Advanced Search
MyIDEAS: Login to save this paper or follow this series

A Folk Theorem for Competing Mechanisms

Contents:

Author Info

  • Peters, Michael
  • Troncoso-Valverde, Cristian

Abstract

We prove a folk theorem for games in which mechanism designers compete in mechanisms and in which there are at least 4 players. All allocations supportable by a centralized mechanism designer, including allocations involving correlated actions (and correlated punishments) can be supported as Bayesian equilibrium outcomes in the competing mechanism game.

Download Info

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.
File URL: http://montoya.econ.ubc.ca/mike/multiple_agency.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Vancouver School of Economics in its series Microeconomics.ca working papers with number michael_peters-2010-17.

as in new window
Length: 0 pages
Date of creation: 13 May 2010
Date of revision: 19 Oct 2013
Handle: RePEc:ubc:pmicro:michael_peters-2010-17

Contact details of provider:
Web page: http://www.economics.ubc.ca/

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Péter Vida & Francoise Forges, 2011. "Implementation of Communication Equilibria by Correlated Cheap Talk: The Two-Player Case," CESifo Working Paper Series 3360, CESifo Group Munich.
  2. Epstein, Larry G. & Peters, Michael, 1999. "A Revelation Principle for Competing Mechanisms," Journal of Economic Theory, Elsevier, vol. 88(1), pages 119-160, September.
  3. Myerson, Roger B, 1979. "Incentive Compatibility and the Bargaining Problem," Econometrica, Econometric Society, vol. 47(1), pages 61-73, January.
  4. Dino Gerardi, 2002. "Unmediated Communication in Games with Complete and Incomplete Information," Cowles Foundation Discussion Papers 1371, Cowles Foundation for Research in Economics, Yale University.
  5. Takuro Yamashita, 2010. "Mechanism Games With Multiple Principals and Three or More Agents," Econometrica, Econometric Society, vol. 78(2), pages 791-801, 03.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ubc:pmicro:michael_peters-2010-17. 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: (Maureen Chin).

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.