This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

One-Shot Public Mediated Talk

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Ehud Lehrer
Sylvain Sorin

Additional information is available for the following registered author(s):

Abstract

We show that any correlation device with rational coefficients can be generated by a mechanism where each player sends a private message to a mediator who in turn makes a public deterministic announcement. Moreover, the mechanism suggested is immunized against individual deviations.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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://www.kellogg.northwestern.edu/research/math/papers/1108.pdf
File Format: application/pdf
File Function: main text
Download Restriction: no

Publisher Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1108.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: May 1994
Date of revision:
Handle: RePEc:nwu:cmsems:1108

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
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC

Order Information:
Email:

For technical questions regarding this item, or to correct its listing, contact: (Fran Walker).

Related research
Keywords:

Other versions of this item:

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.:
  1. Aumann, Robert J, 1987. "Correlated Equilibrium as an Expression of Bayesian Rationality," Econometrica, Econometric Society, vol. 55(1), pages 1-18, January. [Downloadable!] (restricted)
  2. Forges, Francoise M, 1986. "An Approach to Communication Equilibria," Econometrica, Econometric Society, vol. 54(6), pages 1375-85, November. [Downloadable!] (restricted)
  3. Lehrer, Ehud, 1996. "Mediated Talk," International Journal of Game Theory, Springer, vol. 25(2), pages 177-88.
Full references

Cited by:
(explanations, 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.)

  1. Maria Goltsman & Gregory Pavlov, 2008. "How to Talk to Multiple Audiences," UWO Department of Economics Working Papers 20081, University of Western Ontario, Department of Economics. [Downloadable!]
  2. Heller, Yuval, 2005. "Minority-proof cheap-talk protocol," MPRA Paper 7716, University Library of Munich, Germany, revised 26 Feb 2008. [Downloadable!]
  3. Anirban Kar, Indrajit Ray and Robedrto Serrano, 2005. "Multiple Equilibria as a Difficulty in Understanding Correlated Distributions," Discussion Papers 05-18, Department of Economics, University of Birmingham. [Downloadable!]
    Other versions:
  4. R. Vijay Krishna, 2004. "Extended Conversations in Sender-Receiver Games," ESE Discussion Papers 126, Edinburgh School of Economics, University of Edinburgh. [Downloadable!]
  5. Robert J. Aumann & Sergiu Hart, 2002. "Long Cheap Talk," Discussion Paper Series dp284, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem, revised Nov 2002. [Downloadable!]
    Other versions:
    • Robert J. Aumann & Sergiu Hart, 2003. "Long Cheap Talk," Econometrica, Econometric Society, vol. 71(6), pages 1619-1660, November. [Downloadable!] (restricted)
  6. Cédric Wanko, 2008. "Approche Conceptuelle et Algorithmique des Equilibres de Nash Robustes Incitatifs," Working Papers 08-03, LAMETA, Universtiy of Montpellier, revised Feb 2008. [Downloadable!]
  7. Peter Vida, 2005. "A Detail-free Mediator and the 3 Player Case," IEHAS Discussion Papers 0511, Institute of Economics, Hungarian Academy of Sciences. [Downloadable!]
  8. Indrajit Ray, 2002. "Multiple Equilibrium Problem and Non-Canonical Correlation Devices," Working Papers 2002-24, Brown University, Department of Economics. [Downloadable!]
  9. Azrieli, Yaron, 2007. "Categorization and correlation in a random-matching game," MPRA Paper 5475, University Library of Munich, Germany. [Downloadable!]
  10. Adam Tauman Kalai & Ehud Kalai & Dov Samet, 2007. "Voluntary Commitments Lead to Efficiency," Discussion Papers 1444, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  11. GOSSNERÊ, Olivier & VIEILLE, Nicolas, 1998. "Repeated communication through the mechanism ÒandÓ," CORE Discussion Papers 1998056, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE). [Downloadable!]
  12. Hannu Vartiainen, 2009. "A Simple Model of Secure Public Communication," Theory and Decision, Springer, vol. 67(1), pages 101-122, July. [Downloadable!] (restricted)
Statistics
Access and download statistics

Did you know? All bibliographic data on IDEAS has been put in the public domain by the publishers.

This page was last updated on 2009-11-25.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.