Back to Search
Start Over
Codification schemes and finite automata
- Source :
-
Mathematical Social Sciences . Nov2008, Vol. 56 Issue 3, p395-409. 15p. - Publication Year :
- 2008
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01654896
- Volume :
- 56
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Mathematical Social Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 34891527
- Full Text :
- https://doi.org/10.1016/j.mathsocsci.2008.01.007