EVOLUTION AND THE COMPLEXITY OF FINITE AUTOMATA

被引：1

作者：

Kilani, Moez ^{[1
]}

机构：

[1] Univ Sousse, Dept Quantitat Econ, ISG, Rue Abdelaziz el Behi, Sousse 4000, Tunisia

来源：

INTERNATIONAL GAME THEORY REVIEW | 2007年 / 9卷 / 04期

关键词：

Finite automata; complexity of the strategy; cooperation; evolution;

D O I：

10.1142/S0219198907001692

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Prisoner's dilemma played by finite automata is reviewed again using a slightly modified measure of complexity. At a first step, an equilibrium with a large number of possible outcomes is shown to hold. At a second stage, we consider a game of repeated interaction, and show that on (limit) equilibrium only cooperative actions are played. We conclude that cooperation is the result of a (complex) long interaction.

引用

页码：731 / 743

页数：13

共 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] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233
[3] Descriptional complexity of nondeterministic finite automata
Salomaa, Kai
Developments in Language Theory, Proceedings, 2007, 4588 : 31 - 35
[4] The complexity of translating logic to finite automata
Reinhardt, K
AUTOMATA, LOGICS, AND INFINITE GAMES: A GUIDE TO CURRENT RESEARCH, 2002, 2500 : 231 - 238
[5] Descriptional and Computational Complexity of Finite Automata
Holzer, Markus
Kutrib, Martin
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 23 - 42
[6] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 199 - 233
[7] COMPLEXITY OF FINITE, PUSHDOWN, AND STACK AUTOMATA
HUNT, HB
MATHEMATICAL SYSTEMS THEORY, 1976, 10 (01): : 33 - 52
[8] Complexity and Universality of Iterated Finite Automata
Zhang, Jiang
COMPLEX SYSTEMS, 2008, 18 (01): : 145 - 158
[9] Transition Function Complexity of Finite Automata
Valdats, Maris
BALTIC JOURNAL OF MODERN COMPUTING, 2019, 7 (03): : 342 - 353
[10] Jump complexity of finite automata with translucent letters
Mitrana, Victor
Paun, Andrei
Paun, Mihaela
Couso, Jose Ramon Sanchez
THEORETICAL COMPUTER SCIENCE, 2024, 992

← 1 2 3 4 5 →