Dissolving a Partnership Efficiently
AbstractSeveral partners jointly own an asset that may be traded among them. Each partner has a valuation for the asset; the valuations are known privately and drawn independently from a common probability distribution. We characterize the set of all incentive-compatible and interim- individually- rational trading mechanisms, and give a simple necessary and sufficient condition for such mechanisms to dissolve the partnership ex post efficiently. A bidding game is constructed that achieves such dissolution whenever it is possible. Despite incomplete information about the valuation of the asset, a partnership can be dissolved ex post efficiently provided no single partner owns too large a share; this contrasts with Myerson and Satterthwaite's result that ex post efficiency cannot be achieved when the asset is owned by a single party.
Download InfoIf 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.
Bibliographic InfoPaper provided by University of Maryland, Department of Economics - Peter Cramton in its series Papers of Peter Cramton with number 87econ.
Length: 18 pages
Date of creation: 1987
Date of revision: 09 Jun 1998
Publication status: Published in Econometrica, 55:3, May 1987, pages 615-632. Reprinted in Paul Klemperer, ed., The Economic Theory of Auctions, Volume 2, Cheltenham, UK: Edward Elgar, 2000.
Contact details of provider:
Postal: Economics Department, University of Maryland, College Park, MD 20742-7211
Phone: (202) 318-0520
Fax: (202) 318-0520
Web page: http://www.cramton.umd.edu
Auctions; Trading Machanisms; Efficiency; Public Goods;
Other versions of this item:
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
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.:
- Thomas A. Gresik & Mark A. Satterthwaite, 1985.
"The Rate At Which a Simple Market Becomes Efficient as the Number of Traders Increases: An Asymptotic Result for Optimal Trading Mechanisms,"
708, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Thomas A. Gresik & Mark A. Satterthwaite, 1985. "The Rate at Which a Simple Market Becomes Efficient as the Number of Traders Increases: An Asymptotic Result for Optimal Trading Mechanisms," Discussion Papers 641, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Roger B. Myerson, 1977.
"Incentive Compatability and the Bargaining Problem,"
284, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Myerson, Roger B, 1979. "Incentive Compatibility and the Bargaining Problem," Econometrica, Econometric Society, vol. 47(1), pages 61-73, January.
- Bengt Holmstrom & Roger B. Myerson, 1981.
"Efficient and Durable Decision Rules with Incomplete Information,"
495, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Holmstrom, Bengt & Myerson, Roger B, 1983. "Efficient and Durable Decision Rules with Incomplete Information," Econometrica, Econometric Society, vol. 51(6), pages 1799-819, November.
- Myerson, Roger B. & Satterthwaite, Mark A., 1983.
"Efficient mechanisms for bilateral trading,"
Journal of Economic Theory,
Elsevier, vol. 29(2), pages 265-281, April.
- Wilson, Robert B, 1985. "Incentive Efficiency of Double Auctions," Econometrica, Econometric Society, vol. 53(5), pages 1101-15, September.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Peter Cramton).
If references are entirely missing, you can add them using this form.