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 条

[31] Supergames played by finite automata with finite costs of complexity in an evolutionary setting
Cooper, DJ
JOURNAL OF ECONOMIC THEORY, 1996, 68 (01) : 266 - 275
[32] Size Complexity of Two-Way Finite Automata
Kapoutsis, Christos A.
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 47 - 66
[33] Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
Valdats, Maris
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 105 - 117
[34] SOME BOUNDS ON COMPLEXITY OF PREDICATE RECOGNITION BY FINITE AUTOMATA
BREITBART, Y
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 12 (03) : 336 - 349
[35] Operational State Complexity and Decidability of Jumping Finite Automata
Beier, Simon
Holzer, Markus
Kutrib, Martin
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 96 - 108
[36] ON THE COMPUTATIONAL-COMPLEXITY OF FINITE CELLULAR-AUTOMATA
SUTNER, K
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (01) : 87 - 97
[37] The Parameterized Complexity of Chosen Problems for Finite Automata on Trees
Barecka, Agata
Charatonik, Witold
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 129 - +
[38] State Complexity of Reversals of Deterministic Finite Automata with Output
Davies, Sylvie
IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2018, 2018, 10977 : 133 - 145
[39] On the State Complexity of Semi-quantum Finite Automata
Zheng, Shenggen
Gruska, Jozef
Qiu, Daowen
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 601 - 612
[40] Descriptional and computational complexity of finite automata-A survey
Holzer, Markus
Kutrib, Martin
INFORMATION AND COMPUTATION, 2011, 209 (03) : 456 - 470

← 1 2 3 4 5 →