Truthful Revelation Mechanisms for Simultaneous Common Agency Games
In games in which multiple principals contract simultaneously and non-cooperatively with the same agent, standard direct revelation mechanisms in which the agent reports his type(i.e. his exogenous private information) have been proven inadequate to characterize the entire set of equilibrium outcomes. This paper introduces a more general class of revelation mechanisms in which the agent reports also the contractual decisions he is inducing with the principals. We rst show that such a class has the same nice properties as the class of all unrestricted menus: (i) for any equilibrium of any indirect game with arbitrary communication space for the principals, there exists a truthful equilibrium in the game in which the principals are restricted to o¤er revelation mechanisms that sustains the same outcomes; (ii) any truthful equilibrium is robust in the sense that it remains an equilibrium in any game in which the principalsstrategy space is enlarged. We next show how revelation mechanisms can be put to work in applications such as menu auctions, moral hazard settings, and competition in non-linear tariffs to identify necessary and sufficient conditions for the sustainability of outcomes as common agency equilibria.
|Date of creation:||Jul 2007|
|Contact details of provider:|| Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014|
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
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.:
- Han, Seungjin, 2006.
"Menu theorems for bilateral contracting,"
Journal of Economic Theory,
Elsevier, vol. 131(1), pages 157-178, November.
- Piaser, Gwenaël, 2007. "Direct Mechanisms, Menus and Latent Contracts," MPRA Paper 7049, University Library of Munich, Germany.
- Attar, Andrea & Majumdar, Dipjyoti & Piaser, Gwenaël & Porteiro, Nicolás, 2008. "Common agency games: Indifference and separable preferences," Mathematical Social Sciences, Elsevier, vol. 56(1), pages 75-95, July.
- Peters, Michael & Troncoso-Valverde, Cristian, 2010.
"A Folk Theorem for Competing Mechanisms,"
Microeconomics.ca working papers
michael_peters-2010-17, Vancouver School of Economics, revised 19 Oct 2013.
- Dixit, Avinash & Grossman, Gene M. & Helpman, Elhanan, 1997.
"Common Agency and Coordination: General Theory and Application to Government Policy Making,"
3450061, Harvard University Department of Economics.
- Dixit, Avinash & Grossman, Gene M & Helpman, Elhanan, 1997. "Common Agency and Coordination: General Theory and Application to Government Policy Making," Journal of Political Economy, University of Chicago Press, vol. 105(4), pages 752-769, August.
- Bruno Biais & David Martimort & Jean-Charles Rochet, 2000.
"Competing Mechanisms in a Common Value Environment,"
Econometric Society, vol. 68(4), pages 799-838, July.
- Biais, Bruno & Martimort, David & Rochet, Jean-Charles, 1998. "Competing Mechanisms in a Commun Value Environment," IDEI Working Papers 75, Institut d'Économie Industrielle (IDEI), Toulouse.
- Attar, Andrea & Piaser, Gwenael & Porteiro, Nicolas, 2007. "Negotiation and take-it or leave-it in common agency with non-contractible actions," Journal of Economic Theory, Elsevier, vol. 135(1), pages 590-593, July.
- B. Douglas Bernheim & Michael D. Whinston, 1985. "Common Marketing Agency as a Device for Facilitating Collusion," RAND Journal of Economics, The RAND Corporation, vol. 16(2), pages 269-281, Summer.
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1458. 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: (Fran Walker)
If references are entirely missing, you can add them using this form.