Codification schemes and finite automata

• Autores: Penélope Hernández Rojas, Amparo Urbano Salvador
• Localización: Working papers = Documentos de trabajo: Serie AD, Nº. 28, 2006
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.