Efficient trading with nonlinear utility
In an environment in which agents have nonlinear utility and sufficiently asymmetric initial endowments, we show that efficient trading is achievable. This result is in contrast with Myerson and Satterthwaite (1983), which shows efficient trading is not possible if agents have linear utility and asymmetric initial endowments. Our result is also different from Cramton et al. (1987), in which they maintain the linear utility assumption as in Myerson and Satterthwaite but assume that traders' initial endowments are relatively symmetric.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Myerson, Roger B, 1979.
"Incentive Compatibility and the Bargaining Problem,"
Econometric Society, vol. 47(1), pages 61-73, January.
- Roger B. Myerson, 1977. "Incentive Compatability and the Bargaining Problem," Discussion Papers 284, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
- Roger B. Myerson & Mark A. Satterthwaite, 1981. "Efficient Mechanisms for Bilateral Trading," Discussion Papers 469S, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gresik, Thomas A. & Satterthwaite, Mark A., 1989. "The rate at which a simple market converges to efficiency as the number of traders increases: An asymptotic result for optimal trading mechanisms," Journal of Economic Theory, Elsevier, vol. 48(1), pages 304-332, June.
- Cramton, Peter & Gibbons, Robert & Klemperer, Paul, 1987. "Dissolving a Partnership Efficiently," Econometrica, Econometric Society, vol. 55(3), pages 615-632, May.
- Peter Cramton & Robert Gibbons & Paul Klemperer, 1985. "Dissolving a Partnership Efficiently," Working papers 406, Massachusetts Institute of Technology (MIT), Department of Economics.
- Peter Cramton & Robert Gibbons & Paul Klemperer, 1987. "Dissolving a Partnership Efficiently," Papers of Peter Cramton 87econ, University of Maryland, Department of Economics - Peter Cramton, revised 09 Jun 1998.
- Lu, Hu & Robert, Jacques, 2001. "Optimal Trading Mechanisms with Ex Ante Unidentified Traders," Journal of Economic Theory, Elsevier, vol. 97(1), pages 50-80, March. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:46:y:2010:i:4:p:595-606. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.