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 条
  • [31] Some more on the finite automata
    B. F. Melnikov
    A. A. Vakhitova
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (3): : 495 - 505
  • [32] Operations on Unambiguous Finite Automata
    Jirasek, Jozef, Jr.
    Jiraskova, Galina
    Sebej, Juraj
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 243 - 255
  • [33] CONSTRUCTIONS FOR ALTERNATING FINITE AUTOMATA
    FELLAH, A
    JURGENSEN, H
    YU, S
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 35 (1-4) : 117 - 132
  • [34] Superior information is insufficient to win in games between finite automata
    Chernorutskii, V
    Izmailov, R
    Pokrovskii, A
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1996, 34 (02) : 542 - 553
  • [35] Finite State Automata as a Data Storage
    Mindek, Marian
    Hynar, Martin
    DATESO 2005 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS, 2005, : 9 - 19
  • [36] Finite automata crossing the border into economics
    Lee, Kyu Sang
    WMSCI 2006: 10TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IV, PROCEEDINGS, 2006, : 41 - 46
  • [37] Amount of nonconstructivity in deterministic finite automata
    Freivalds, Rusins
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (38-39) : 3436 - 3443
  • [38] From regular expressions to finite automata
    Champarnaud, JM
    Ponty, JL
    Ziadi, D
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 72 (04) : 415 - 431
  • [39] A necessary condition on invertibility of finite automata
    Renji Tao
    Shihua Chen
    Science in China Series E: Technological Sciences, 1997, 40 : 637 - 643
  • [40] Abstracting an Operational Semantics to Finite Automata
    Baklanova, Nadezhda
    Ricciotti, Wilmer
    Smaus, Jan-Georg
    Strecker, Martin
    INFORMATION AND COMMUNICATION TECHNOLOGIES IN EDUCATION, RESEARCH, AND INDUSTRIAL APPLICATIONS, 2016, 594 : 109 - 123
12345