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.
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. & 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.
- 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. 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:2:p:238-247. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.