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

Codification Schemes And Finite Automata

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Amparo Urbano (Universitat de València)
Penélope Hernández (Universidad de Alicante)
Abstract

This paper is a note on how Information Theory and Codification Theory are helpful in the computational design both of communication protocols and strategy sets in the framework of finitely repeated games played by boundedly rational agents. More precisely, we show the usefulness of both theories to improve the existing automata bounds of Neyman¿s (1998) work on finitely repeated games played by finite automata.

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-2006-28.pdf
File Format: application/pdf
File Function: Fisrt version / Primera version, 2007
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 2006-28.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 21 pages
Date of creation: Jan 2007
Date of revision:
Publication status: Published by Ivie
Handle: RePEc:ivi:wpasad:2006-28

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: Complexity codification repeated games finite automata

Other versions of this item:

Find related papers by JEL classification:
C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

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. Gossner, Olivier & Vieille, Nicolas, 2002. "How to play with a biased coin?," Games and Economic Behavior, Elsevier, vol. 41(2), pages 206-226, November. [Downloadable!] (restricted)
    Other versions:
  2. Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer, vol. 29(3), pages 309-325. [Downloadable!] (restricted)
  3. Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2003. "Online Matching Pennies," Discussion Paper Series dp316, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
  4. Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February. [Downloadable!] (restricted)
  5. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February. [Downloadable!] (restricted)
  6. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November. [Downloadable!] (restricted)
  7. Olivier Gossner & Abraham Neyman & Penélope Hernández, 2005. "Optimal Use Of Communication Resources," Working Papers. Serie AD 2005-06, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie). [Downloadable!]
    Other versions:
  8. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229. [Downloadable!] (restricted)
  9. O. Gossner & P. Hernandez, 2001. "On the complexity of coordination," THEMA Working Papers 2001-21, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise. [Downloadable!]
  10. Zemel, Eitan, 1989. "Small talk and cooperation: A note on bounded rationality," Journal of Economic Theory, Elsevier, vol. 49(1), pages 1-9, October. [Downloadable!] (restricted)
  11. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June. [Downloadable!] (restricted)
  12. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March. [Downloadable!] (restricted)
    Other versions:
  13. Neyman, Abraham & Okada, Daijiro, 1999. "Strategic Entropy and Complexity in Repeated Games," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 191-223, October. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? You can import bibliographic info in various formats into you bibliographic tool, or just into your word processor. See under "publisher info" on each abstract page.

This page was last updated on 2008-9-30.

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.