Codification schemes and finite automata
AbstractThis 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 InfoIf 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.
Bibliographic InfoPaper provided by Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie) in its series Working Papers. Serie AD with number 2006-28.
Length: 21 pages
Date of creation: Dec 2000
Date of revision:
Publication status: Published by Ivie
Complexity; codification; repeated games; finite automata;
Other versions of this item:
- 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:
- NEP-ALL-2007-01-23 (All new papers)
- NEP-CBE-2007-01-23 (Cognitive & Behavioural Economics)
- NEP-GTH-2007-01-23 (Game Theory)
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.:
- O. Gossner & N. Vieille, 1999.
"How to play with a biased coin ?,"
THEMA Working Papers
99-31, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Ehud Kalai & William Stanford, 1986.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
- Ariel Rubinstein, 1997.
"Finite automata play the repeated prisioners dilemma,"
Levine's Working Paper Archive
1639, David K. Levine.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2004.
"Optimal Use of Communication Resources,"
Discussion Paper Series
dp377, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
- GOSSNER, Olivier & HERNANDEZ, Pénélope, 2001.
"On the complexity of coordination,"
CORE Discussion Papers
2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- Zemel, Eitan, 1989. "Small talk and cooperation: A note on bounded rationality," Journal of Economic Theory, Elsevier, vol. 49(1), pages 1-9, October.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer, vol. 29(3), pages 309-325.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- 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.
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2003. "Online Matching Pennies," Discussion Paper Series dp316, The Center for the Study of Rationality, Hebrew University, Jerusalem.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Departamento de Edición).
If references are entirely missing, you can add them using this form.