Codification schemes and finite automata

被引：0
作者：
Hernandez, Penelope [1 ]
Urbano, Amparo
机构：
[1] Univ Valencia, Dept Anal Econ, Valencia 46022, Spain
来源：
MATHEMATICAL SOCIAL SCIENCES | 2008年 / 56卷 / 03期
关键词：
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
相关论文
共 50 条
  • [1] Complexity of control on finite automata
    Delvenne, Jean-Charles
    Blondel, Vincent D.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (06) : 977 - 986
  • [2] Transition Function Complexity of Finite Automata
    Valdats, Maris
    BALTIC JOURNAL OF MODERN COMPUTING, 2019, 7 (03): : 342 - 353
  • [3] Operations on Boolean and Alternating Finite Automata
    Hospodar, Michal
    Jiraskova, Galina
    Krajnakova, Ivana
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025,
  • [4] On the transformation of two-way finite automata to unambiguous finite automata
    Petrov, Semyon
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2023, 295
  • [5] Problems on Finite Automata and the Exponential Time Hypothesis
    Fernau, Henning
    Krebs, Andreas
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 89 - 100
  • [6] Finite Automata and Randomness
    Staiger, Ludwig
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 1 - 10
  • [7] Are Statecharts Finite Automata?
    Lu, Hanlin
    Yu, Sheng
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2009, 5642 : 258 - 261
  • [8] Unambiguous finite automata over a unary alphabet
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2012, 212 : 15 - 36
  • [9] Undecidability and Finite Automata
    Endrullis, Jorg
    Shallit, Jeffrey
    Smith, Tim
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 160 - 172
  • [10] Synchronization of finite automata
    Volkov, M. V.
    RUSSIAN MATHEMATICAL SURVEYS, 2022, 77 (05) : 819 - 891
12345