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.
Year of publication: |
2008
|
---|---|
Authors: | Hernández, Penélope ; Urbano, Amparo |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 56.2008, 3, p. 395-409
|
Publisher: |
Elsevier |
Keywords: | Complexity Codification Repeated games Finite automata |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Codification schemes and finite automata
Hernández, Penélope, (2008)
-
Codification schemes and finite automata
Hernández, Penélope, (2006)
-
Pragmatic languages with universal grammars
Hernández, Penélope, (2012)
- More ...