6533b7dbfe1ef96bd1271539

RESEARCH PRODUCT

Codification schemes and finite automata

Amparo UrbanoPenélope Hernández

subject

Complexity codification repeated games finite automataTheoretical computer scienceFinite-state machineSociology and Political Sciencejel:C72jel:C73ComputingMilieux_PERSONALCOMPUTINGGeneral Social SciencesRational agentInformation theoryAutomatonRepeated gameAutomata theoryQuantum finite automataStatistics Probability and UncertaintyCommunications protocolGeneral PsychologyMathematics

description

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.

yearjournalcountryeditionlanguage
2000-12-01Mathematical Social Sciences
https://doi.org/10.1016/j.mathsocsci.2008.01.007