A note on linked bargaining
A recent result by Jackson and Sonnenschein (2007) describes a general framework for overcoming incentive constraints by linking together independent copies of a Bayesian decision problem. A special case of that work shows that if copies of a standard two-player Bayesian bargaining problem are independently linked (players receive valuations and trade simultaneously on a number of identical copies), then the utility cost associated with incentive constraints tends to 0 as the number of linked problems tends to infinity. We improve upon that result, increasing the rate of convergence from polynomial to exponential and eliminating unwanted trades in the limit, by introducing a mechanism that uses a slightly richer and more refined strategy space. Although very much in the same spirit, our declarations are constrained by a distribution which is skewed away from the expected distribution of player types. When a sufficiently large number of bargaining problems are linked, "truth" is an equilibrium. Moreover, this equilibrium is incentive compatible with the utility cost of incentive constraints almost surely equal to 0.
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.:
- Roger B. Myerson & Mark A. Satterthwaite, 1981.
"Efficient Mechanisms for Bilateral Trading,"
469S, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O Jackson & Hugo F Sonnenschein, 2007. "Overcoming Incentive Constraints by Linking Decisions -super-1," Econometrica, Econometric Society, vol. 75(1), pages 241-257, 01.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:46:y:2010:i:2:p:238-247. 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: (Shamier, Wendy)
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.