Codification schemes and finite automata
This paper is a note on how Information Theory and Codification Theory are helpful in the computational design of both communication protocols and strategy sets in the framework of finitely repeated games played by bounded rational agents. More precisely, we show the usefulness of both theories to improve the existing automata bounds on the work of Neyman (1998) Finitely repeated games with finite automata, Mathematics of Operations Research, 23 (3), 513-552.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2003. "Online Matching Pennies," Discussion Paper Series dp316, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Olivier Gossner & Penélope Hernández & Abraham Neyman, 2006.
"Optimal Use of Communication Resources,"
Econometric Society, vol. 74(6), pages 1603-1636, November.
- Olivier Gossner & Pénélope Hernández & Abraham Neyman, 2006. "Optimal use of communication resources," Post-Print halshs-00754118, HAL.
- 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).
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2004. "Optimal Use of Communication Resources," Discussion Paper Series dp377, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Gossner, Olivier & Vieille, Nicolas, 2002.
"How to play with a biased coin?,"
Games and Economic Behavior,
Elsevier, vol. 41(2), pages 206-226, November.
- 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.
- Gossner, O. & Vieille, N., 1999. "How to play with a biased coin?," Papers 99-31, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Ben-Porath, E., 1991.
"Repeated games with Finite Automata,"
7-91, Tel Aviv - the Sackler Institute of Economic Studies.
- Zemel, Eitan, 1989. "Small talk and cooperation: A note on bounded rationality," Journal of Economic Theory, Elsevier, vol. 49(1), pages 1-9, October.
- Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
- 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.
- 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.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- 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.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(3), pages 309-325.
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:56:y:2008:i:3:p:395-409. 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: (Zhang, Lei)
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.