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 条
  • [21] Unconventional Finite Automata and Algorithms
    Balodis, Kaspars
    BALTIC JOURNAL OF MODERN COMPUTING, 2016, 4 (03): : 561 - 582
  • [22] Inkdots as advice for finite automata
    Kucuk, Ugur
    Say, A. C. Cem
    Yakaryilmaz, Abuzer
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2017, 19 (03)
  • [23] Disturbance Decoupling in Finite Automata
    Zhirabok, Alexey
    Shumsky, Alexey
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 118 - 129
  • [24] Cycle Height of Finite Automata
    Keeler, Chris
    Salomaa, Kai
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 200 - 211
  • [25] Homomorphic Encryption for Finite Automata
    Genise, Nicholas
    Gentry, Craig
    Halevi, Shai
    Li, Baiyu
    Micciancio, Daniele
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2019, PT II, 2019, 11922 : 473 - 502
  • [26] EVOLUTION AND THE COMPLEXITY OF FINITE AUTOMATA
    Kilani, Moez
    INTERNATIONAL GAME THEORY REVIEW, 2007, 9 (04) : 731 - 743
  • [27] Coevolution of finite automata with errors
    Christos A. Ioannou
    Journal of Evolutionary Economics, 2014, 24 : 541 - 571
  • [28] Performance of hardcoded finite automata
    Ngassam, EK
    Kourie, DG
    Watson, BW
    SOFTWARE-PRACTICE & EXPERIENCE, 2006, 36 (05) : 525 - 538
  • [29] An alternating hierarchy for finite automata
    Geffert, Viliam
    THEORETICAL COMPUTER SCIENCE, 2012, 445 : 1 - 24
  • [30] Normalized expressions and finite automata
    Champarnaud, J. -M.
    Ouardi, F.
    Ziadi, D.
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2007, 17 (01) : 141 - 154
12345