 A note on linked bargainingZachary Cohn Journal of Mathematical Economics, 2010, vol. 46, issue 2, 238-247 Abstract: 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. Keywords: Linked; bargaining; Mechanism; design; Bayesian; equilibrium; Efficiency (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:46:y:2010:i:2:p:238-247 Access Statistics for this article Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii More articles in Journal of Mathematical Economics from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.