Codification schemes and finite automata

被引:0
作者
Hernandez, Penelope [1 ]
Urbano, Amparo
机构
[1] Univ Valencia, Dept Anal Econ, Valencia 46022, Spain
关键词
Complexity; Codification; Repeated games; Finite automata;
D O I
10.1016/j.mathsocsci.2008.01.007
中图分类号
F [经济];
学科分类号
02 ;
摘要
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:395 / 409
页数:15
相关论文
共 19 条
[1]   THE STRUCTURE OF NASH EQUILIBRIUM IN REPEATED GAMES WITH FINITE AUTOMATA [J].
ABREU, D ;
RUBINSTEIN, A .
ECONOMETRICA, 1988, 56 (06) :1259-1281
[2]  
[Anonymous], NATO ASI SERIES F
[3]   REPEATED GAMES WITH FINITE AUTOMATA [J].
BENPORATH, E .
JOURNAL OF ECONOMIC THEORY, 1993, 59 (01) :17-32
[4]  
Cover TM., 1991, WILEY SERIES TELECOM, P63
[5]   Empirical distributions of beliefs under imperfect observation [J].
Gossner, O ;
Tomala, T .
MATHEMATICS OF OPERATIONS RESEARCH, 2006, 31 (01) :13-30
[6]   On the complexity of coordination [J].
Gossner, O ;
Hernández, P .
MATHEMATICS OF OPERATIONS RESEARCH, 2003, 28 (01) :127-140
[7]   How to play with a biased coin? [J].
Gossner, O ;
Vieille, N .
GAMES AND ECONOMIC BEHAVIOR, 2002, 41 (02) :206-226
[8]  
GOSSNER O, 2003, DISCUSSION PAPERS CT, V316
[9]   Optimal use of communication resources [J].
Gossner, Olivier ;
Hernandez, Penelope ;
Neyman, Abraham .
ECONOMETRICA, 2006, 74 (06) :1603-1636
[10]   FINITE RATIONALITY AND INTERPERSONAL COMPLEXITY IN REPEATED GAMES [J].
KALAI, E ;
STANFORD, W .
ECONOMETRICA, 1988, 56 (02) :397-410