Automata-based Adaptive Behavior for Economical Modelling Using Game Theory

In this paper, we deal with some specific domains of applications to game theory. This is one of the major class of models in the new approaches of modelling in the economic domain. For that, we use genetic automata which allow to buid adaptive strategies for the players. We explain how the automata-based formalism proposed - matrix representation of automata with multiplicities - allows to define a semi-distance between the strategy behaviors. With that tools, we are able to generate an automatic processus to compute emergent systems of entities whose behaviors are represented by these genetic automata.

[1]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[2]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[3]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[4]  R. Stanley,et al.  Enumerative Combinatorics: Index , 1999 .

[5]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[6]  Agostino Poggi,et al.  Multiagent Systems , 2006, Intelligenza Artificiale.

[7]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[8]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[9]  H. H. Schaefer,et al.  Topological Vector Spaces , 1967 .

[10]  F. Trèves.  Topological vector spaces, distributions and kernels , 1967 .

[11]  Jean-Marc Champarnaud,et al.  Derivatives of rational expressions and related theorems , 2004, Theor. Comput. Sci..

[12]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[13]  John R. Koza,et al.  Hidden Order: How Adaptation Builds Complexity. , 1995, Artificial Life.

[14]  Lotfi A. Zadeh,et al.  General System Theory , 1962 .

[15]  John H. Holland,et al.  Hidden Order: How Adaptation Builds Complexity , 1995 .

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  Éric Laugerotte,et al.  Algebraic elimination of epsilon-transitions , 2004, Discret. Math. Theor. Comput. Sci..

[18]  Jonathan S. Golan,et al.  Power algebras over semirings , 1999 .

[19]  Cyrille Bertelle,et al.  ADAPTIVE BEHAVIOUR FOR PRISONER DILEMMA STRATEGIES BASED ON AUTOMATA WITH MULTIPLICITIES , 2002 .

[20]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[21]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[22]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[23]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.