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 条

[21] State complexity of additive weighted finite automata
Salomaa, Kai
Schofield, Paul
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (06) : 1407 - 1416
[22] The complexity of probabilistic versus quantum finite automata
Midrijanis, G
SOFSEM 2002: THEORY AND PRACTICE OF INFORMATICS, 2002, 2540 : 273 - 278
[23] Characterization and complexity results on jumping finite automata
Fernau, Henning
Paramasivan, Meenakshi
Schmid, Markus L.
Vorel, Vojtech
THEORETICAL COMPUTER SCIENCE, 2017, 679 : 31 - 52
[24] The Complexity of Compressed Membership Problems for Finite Automata
Artur Jeż
Theory of Computing Systems, 2014, 55 : 685 - 718
[25] State complexity of unambiguous operations on finite automata
Jiraskova, Galina
Okhotin, Alexander
THEORETICAL COMPUTER SCIENCE, 2019, 798 : 52 - 64
[26] The complexity of probabilistic versus deterministic finite automata
Ambainis, A
ALGORITHMS AND COMPUTATION, 1996, 1178 : 233 - 238
[27] Complexity of Unary Exclusive Nondeterministic Finite Automata
Kutrib, Martin
Malcher, Andreas
Wendlandt, Matthias
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
[28] Complexity Analysis: Transformation Monoids of Finite Automata
Brandl, Christian
Simon, Hans Ulrich
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 143 - 154
[29] More on the Descriptional Complexity of Products of Finite Automata
Holzer, Markus
Rauch, Christian
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
[30] Computational complexity of finite asynchronous cellular automata
Dennunzio, Alberto
Formenti, Enrico
Manzoni, Luca
Mauri, Giancarlo
Porreca, Antonio E.
THEORETICAL COMPUTER SCIENCE, 2017, 664 : 131 - 143

← 1 2 3 4 5 →