×

zbMATH — the first resource for mathematics

Efficient trading with restriction. (English) Zbl 1195.91105
Summary: In a classical paper by P. Cramton, R. Gibbons and P. Klemperer [Econometrica 55, 615–632 (1987; Zbl 0632.90097); CGK], it is shown that an efficient trading mechanism exists if traders’ initial endowments are not too asymmetric. In this paper, we extend the CGK model by assuming that traders are not allowed to consume more than a given amount (upper bound) of the good. In the CGK model, instead the only restriction is that no agent can consume more than the entire endowment in the economy. By varying this upper bound, we characterize the set of endowments (efficient region) in which efficient trading mechanisms exist in terms of this upper bound. We show that the efficient region becomes smaller when the upper bound decreases. On the other hand, when this upper bound becomes the entire endowment of the economy, we obtain the result in CGK as a special case.
MSC:
91B60 Trade models
91B26 Auctions, bargaining, bidding and selling, and other market models
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Cramton P, Gibbons R, Klemperer P (1987) Dissolving a partnership efficiently. Econometrica 55: 615–632 · Zbl 0632.90097 · doi:10.2307/1913602
[2] Lewis T, Sappington DEM (1989) Countervailing incentives in agency problems. J Econ Theory 49: 294–313 · Zbl 0682.90015 · doi:10.1016/0022-0531(89)90083-5
[3] Lu H, Robert J (2001) Optimal trading mechanisms with ex ante unidentified traders. J Econ Theory 97: 50–80 · Zbl 0994.91043 · doi:10.1006/jeth.2000.2706
[4] Myerson RB (1979) Incentive compatibility and the bargaining problem. Econometrica 47: 61–73 · Zbl 0399.90008 · doi:10.2307/1912346
[5] Myerson RB (1981) Optimal auction design. Math Oper Res 6: 58–73 · Zbl 0496.90099 · doi:10.1287/moor.6.1.58
[6] Myerson RB, Satterthwaite MA (1983) Efficient mechanisms for bilateral trading. J Econ Theory 28: 265–281 · Zbl 0523.90099 · doi:10.1016/0022-0531(83)90048-0
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.