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! ]

Optimal Use Of Communication Resources

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Olivier Gossner () (Paris-Jourdan Sciences Économiques)
Abraham Neyman (Hebrew University of Jerusalem)
Penélope Hernández (Universidad de Alicante)

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

Abstract

We study a repeated game with asymmetric information about a dynamic state of nature. In the course of the game, the better informed player can communicate some or all of his information with the other. Our model covers costly and/or bounded communication. We characterize the set of equilibrium payoffs, and contrast these with the communication equilibrium payoffs, which by definition entail no communication costs.

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 file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.ivie.es/downloads/docs/wpasad/wpasad-2005-06.pdf
File Format: application/pdf
File Function: Fisrt version / Primera version, 2005
Download Restriction: no

Publisher Info
Paper provided by Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie) in its series Working Papers. Serie AD with number 2005-06.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 38 pages
Date of creation: Feb 2005
Date of revision:
Publication status: Published by Ivie
Handle: RePEc:ivi:wpasad:2005-06

Contact details of provider:
Postal: C/ Guardia Civil, 22, Esc 2a, 1o, E-46020 VALENCIA
Phone: +34 96 319 00 50
Fax: +34 96 319 00 55
Email:
Web page: http://www.ivie.es/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Departamento de Edición).

Related research
Keywords: Repeated games communication entropy

Other versions of this item:

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information

This paper has been announced in the following NEP Reports:

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. Ben-Porath, Elchanan, 2003. "Cheap talk in games with incomplete information," Journal of Economic Theory, Elsevier, vol. 108(1), pages 45-71, 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. Gerardi, Dino, 2004. "Unmediated communication in games with complete and incomplete information," Journal of Economic Theory, Elsevier, vol. 114(1), pages 104-131, January. [Downloadable!] (restricted)
  4. Forges, Francoise, 1990. "Universal Mechanisms," Econometrica, Econometric Society, vol. 58(6), pages 1341-64, November. [Downloadable!] (restricted)
  5. Radner, Roy, 1993. "The Organization of Decentralized Information Processing," Econometrica, Econometric Society, vol. 61(5), pages 1109-46, September. [Downloadable!] (restricted)
  6. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-58, March. [Downloadable!] (restricted)
    Other versions:
  7. Arrow, Kenneth J, 1985. "Informational Structure of the Firm," American Economic Review, American Economic Association, vol. 75(2), pages 303-07, May. [Downloadable!] (restricted)
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. Amparo Urbano & Penélope Hernández, 2007. "Codification Schemes And Finite Automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie). [Downloadable!]
  2. Abraham Neyman Null & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy and Nonstationary Bounded Recall," Departmental Working Papers 200514, Rutgers University, Department of Economics. [Downloadable!]
  3. Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Discussion Paper Series dp476, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
    Other versions:
  4. Olivier Gossner & Rida Laraki & Tristan Tomala, 2004. "Maxmin computation and optimal correlation in repeated games with signals," Post-Print hal-00242940_v1, HAL. [Downloadable!]
  5. Abraham Neyman & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall," Discussion Paper Series dp411, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? The yearly budget of IDEAS is exactly $0: it relies entirely on volunteer work.

This page was last updated on 2008-8-10.

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.