Codification schemes and finite automata

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.

MoreLess

Year of publication:	2000-12
Authors:	Salvador, Amparo Urbano ; Rojas, Penélope Hernández
Institutions:	Instituto Valenciano de Investigaciones Económicas (IVIE)
Subject:	Complexity \| codification \| repeated games \| finite automata

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Working Papers. Serie AD.
Type of publication:	Book / Working Paper
Language:	English
Notes:	Published by Ivie 21 pages
Classification:	C73 - Stochastic and Dynamic Games ; C72 - Noncooperative Games
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005731205