Adaptive automata-based model for iterated n-player's prisoner's dilemma

In this paper, we present a new technique of representing the player's strategies by adaptive automata, which can handle complex strategies in large populations effectively. The representation the player's strategies have a great impact on changing the player's behaviour in rational environments. This model is built on the basis of changing the behaviour of the player's gradually toward the cooperation. The gradualism is achieved by constructing three different adaptive automata at three different levels. The results showed that our model could represent the player's strategies efficiently. The results proofed that the model is able to enhance the cooperation level between the participated player's through few tournaments.

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

[2]  Jaime Simão Sichman,et al.  On the effect of the expressiveness of strategy representation languages in multiagent based simulations : an experiment with an evolutionary model of the iterated n-players prisoner ’ s dilemma , 2010 .

[3]  Miklos N. Szilagyi.  An Investigation of N-person Prisoners' Dilemmas , 2003, Complex Syst..

[4]  Colm O'Riordan,et al.  Spatial N-player Dilemmas in Changing Environments , 2007, SGAI Conf..

[5]  Cyrille Bertelle,et al.  Automata-based Adaptive Behavior for Economical Modelling Using Game Theory , 2007, ArXiv.

[6]  Masanori Takezawa,et al.  Revisiting "The evolution of reciprocity in sizable groups": continuous reciprocity in the repeated n-person prisoner's dilemma. , 2010, Journal of theoretical biology.

[7]  Yva Doually,et al.  Information Technology , 1997, IFIP Advances in Information and Communication Technology.

[8]  H. Pistori,et al.  Adaptive Finite State Automata and Genetic Algorithms: Merging Individual Adaptation and Population Evolution , 2005 .

[9]  M. Aziz-Alaoui,et al.  Emergent properties in natural and artificial dynamical systems , 2006 .

[10]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization approaches to coevolve strategies for the iterated prisoner's dilemma , 2005, IEEE Transactions on Evolutionary Computation.

[11]  Shahaboddin Shamshirband,et al.  A distributed approach for coordination between traffic lights based on game theory , 2012, Int. Arab J. Inf. Technol..

[12]  Martin Zwick,et al.  N-Player Prisoner's Dilemma in Multiple Groups: A Model of Multilevel Selection , 2000 .

[13]  Tobias Kretz,et al.  A Round-Robin Tournament of the Iterated Prisoner's Dilemma with Complete Memory-Size-Three Strategies , 2010, Complex Syst..

[14]  Jun Zhang,et al.  Adaptive learning via selectionism and Bayesianism, Part I: Connection between the two , 2009, Neural Networks.

[15]  Eizo Akiyama,et al.  Reputation and the evolution of cooperation in sizable groups , 2005, Proceedings of the Royal Society B: Biological Sciences.

[16]  Sung-Bae Cho,et al.  The Impact of Payoff Function and Local Interaction on the N-Player Iterated Prisoner's Dilemma , 2000, Knowledge and Information Systems.

[17]  Raymond Chiong,et al.  Co-evolutionary Learning in the N-player Iterated Prisoner's Dilemma with a Structured Environment , 2009, ACAL.

[18]  Xin Yao,et al.  Co-Evolution in Iterated Prisoner's Dilemma with Intermediate Levels of Cooperation: Application to Missile Defense , 2002, Int. J. Comput. Intell. Appl..

[19]  Colm O'Riordan,et al.  Stable Cooperation in the N-Player Prisoner's Dilemma: The Importance of Community Structure , 2007, Adaptive Agents and Multi-Agents Systems.