In this paper non-convexity in economics has been revisited. Shapley-Folkman-Lyapunov theorem has been tested with the asymmetric auctions where bidders follow log-concave probability distributions (non-convex preferences). Ten standard statistical distributions have been used to describe the bidders’ behavior. In principle what is been tested is that equilibrium price can be achieved where the sum of large number non-convex sets is convex (approximately), so that optimization is possible. Convexity is thus very important in economics
We introduce log-convexity for bargaining problems. We show that the class of all regular and log-co...
While auction research, including asymmetric auctions, has grown significantly in recent years, ther...
We analyze competitive pressures in a sequence of auctions with a growing number of bidders, in a mo...
In this paper Myerson-Satterthwaite theorem with asymmetric First price auction (FPA) has been subje...
The Bertrand Oligopoly situation with Shubik's demand functions is modelled as a cooperative TU game...
We study competitive economy equilibrium computation. We show that, for the first time, the equilibr...
If Cournot oligopolists may sell their output prior to its production (forward trading), competition...
Added constraint sampling result, simplified sampling results, reformat, etcThe Shapley-Folkman theo...
This paper investigates simultaneous move capacity constrained price competition game among three fi...
I solve a first-price auction for two bidders with asymmetric budget distributions and known valuati...
A monopolist wishes to maximize her profits by finding an optimal price menu. After she announces a ...
While auction research, including asymmetric auctions, has grown significantly in recent years, ther...
Draft version dated December 25, 2007 originally deposited in SSRN working paper series. Final versi...
The convexity assumptions required for the Arrow-Debreu theorem are reasonable and real-istic for pr...
This thesis consists of two parts. In the first part, we concentrate on the computation of Market Eq...
We introduce log-convexity for bargaining problems. We show that the class of all regular and log-co...
While auction research, including asymmetric auctions, has grown significantly in recent years, ther...
We analyze competitive pressures in a sequence of auctions with a growing number of bidders, in a mo...
In this paper Myerson-Satterthwaite theorem with asymmetric First price auction (FPA) has been subje...
The Bertrand Oligopoly situation with Shubik's demand functions is modelled as a cooperative TU game...
We study competitive economy equilibrium computation. We show that, for the first time, the equilibr...
If Cournot oligopolists may sell their output prior to its production (forward trading), competition...
Added constraint sampling result, simplified sampling results, reformat, etcThe Shapley-Folkman theo...
This paper investigates simultaneous move capacity constrained price competition game among three fi...
I solve a first-price auction for two bidders with asymmetric budget distributions and known valuati...
A monopolist wishes to maximize her profits by finding an optimal price menu. After she announces a ...
While auction research, including asymmetric auctions, has grown significantly in recent years, ther...
Draft version dated December 25, 2007 originally deposited in SSRN working paper series. Final versi...
The convexity assumptions required for the Arrow-Debreu theorem are reasonable and real-istic for pr...
This thesis consists of two parts. In the first part, we concentrate on the computation of Market Eq...
We introduce log-convexity for bargaining problems. We show that the class of all regular and log-co...
While auction research, including asymmetric auctions, has grown significantly in recent years, ther...
We analyze competitive pressures in a sequence of auctions with a growing number of bidders, in a mo...