Cooperative optimization in cellular automata - based multiagent systems with spatio-temporally generalized prisoner's dilemma model

  • Authors:
  • Michal Seredynski;Romuald Kotowski;Wojciech Maka

  • Affiliations:
  • Polish-Japanese Institute of Information Technology, Warsaw, Poland;Polish-Japanese Institute of Information Technology, Warsaw, Poland;Polish-Japanese Institute of Information Technology, Warsaw, Poland

  • Venue:
  • KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A multiagent system operating in the two-dimensional cellular automata (CA) space is considered. Each cell of CA is treated as an agent taking part in Spatio-temporally Generalized Prisoner's Dilemma (STGPD) game. Each agent currently uses one of the following strategies: always defect (all D), always cooperate (all C) or k-D denoting a wiling to cooperate until a number of defecting neighbors is less or equal to k. Periodically agents update their current actions in order to maximize their own profit. We are interested in the phenomena of possibly emerging global cooperation of CA-based agents of STGPD model. Our study is motivated by a potential application of presented model for organization of mobile ad hoc networks. We study the model under different starting settings of the model parameters and observe conditions of emerging a global cooperation between agents. We discover a number of perspective regions of the game with different types and patterns of cooperation.