Codification schemes and finite automata

Amparo Urbano and Penelope Hernandez ()

Working Papers. Serie AD from Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie)

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.

Keywords: Complexity; codification; repeated games; finite automata (search for similar items in EconPapers)
JEL-codes: C72 C73 (search for similar items in EconPapers)
Pages: 21 pages
Date: 2000-12
New Economics Papers: this item is included in nep-cbe and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published by Ivie

Downloads: (external link)
http://www.ivie.es/downloads/docs/wpasad/wpasad-2006-28.pdf Fisrt version / Primera version, 2000 (application/pdf)

Related works:
Journal Article: Codification schemes and finite automata (2008)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ivi:wpasad:2006-28

Access Statistics for this paper

More papers in Working Papers. Serie AD from Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie) Contact information at EDIRC.
Bibliographic data for series maintained by Departamento de Edición ().