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 条

[41] State Complexity of Unambiguous Operations on Deterministic Finite Automata
Jiraskova, Galina
Okhotin, Alexander
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 188 - 199
[42] On the descriptional complexity of finite automata with modified acceptance conditions
Holzer, M
Kutrib, M
THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 267 - 285
[43] Operational State Complexity and Decidability of Jumping Finite Automata
Beier, Simon
Holzer, Markus
Kutrib, Martin
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2019, 30 (01) : 5 - 27
[44] ON THE STATE COMPLEXITY OF SEMI-QUANTUM FINITE AUTOMATA
Zheng, Shenggen
Gruska, Jozef
Qiu, Daowen
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2014, 48 (02): : 187 - 207
[45] State complexity of basic operations on nondeterministic finite automata
Holzer, M
Kutrib, M
IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 148 - 157
[46] The complexity of compressing subsegments of images described by finite automata
Karhumäki, J
Plandowski, W
Rytter, W
DISCRETE APPLIED MATHEMATICS, 2003, 125 (2-3) : 235 - 254
[47] THE PARALLEL COMPLEXITY OF FINITE-STATE AUTOMATA PROBLEMS
SANG, C
HUYNH, DT
INFORMATION AND COMPUTATION, 1992, 97 (01) : 1 - 22
[48] Communication complexity method for measuring nondeterminism in finite automata
Hromkovic, J
Seibert, S
Karhumäki, J
Klauck, H
Schnitger, G
INFORMATION AND COMPUTATION, 2002, 172 (02) : 202 - 217
[49] Nondeterministic finite automata - Recent results on the descriptional and computational complexity
Holzer, Markus
Kutrib, Martin
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 1 - +
[50] State and transition complexity of Watson-Crick finite automata
Paun, A
Paun, M
FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 409 - 420

← 1 2 3 4 5 →