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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Axelrod, R.: The Evolution of Strategies in the Iterated Prisoner’s Dilemma. In: Genetic Algorithms and Simulated Annealing, Pitmann, pp. 31–41 (1987)
Buchegger, S., Le Boudec, J.-Y.: Performance analysis of the confidant protocol. In: Proceedings of MobiHoc, pp. 226–236 (2002)
Buttyan, L., Hubaux, J.P.: Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks. ACM Journal for Mobile Networks (2002)
Howley, E., O’Riordan, C.: The Emergence of Cooperation among Agents using Simple Fixed Bias Tagging. In: Proceedings of Congress on Evolutionary Computation 2005, pp. 1011–1016 (2005)
Ilyas, M. (ed.): Mobile Computing Handbook. Auerbach Publications (2005)
Katsumata, Y., Ishida, Y.: On a Membrane Formation in a Spatio-temporally Generalized Prisoner’s Dilemma. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 60–66. Springer, Heidelberg (2008)
Michiardi, P., Molva, R.: CORE: a Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks. In: Proceedings of the 6th IFIP Conference on Security, Communications, and Multimedia, CMS (2002)
Namikawa, N., Ishibuchi, H.: Evolution of iterated prisoner’s dilemma game strategies in structured demes under random pairing in game playing. IEEE Transactions on Evolutionary Computation 9(6), 552–561 (2005)
Nowak, M.A., May, R.M.: The spatial dilemmas of evolution. Int. J. Bifurc. Chaos 3, 35–78 (1993)
Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Cooperation in wireless ad hoc networks. In: Proceedings of INFOCOM, vol. 2, pp. 808–817. IEEE, Los Alamitos (2003)
Wolfram, S.: A New Kind of Science. Wolfram Media, Inc., Champaign (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seredynski, M., Kotowski, R., Ma̧ka, W. (2010). Cooperative Optimization in Cellular Automata - Based Multiagent Systems with Spatio-temporally Generalized Prisoner’s Dilemma Model. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2010. Lecture Notes in Computer Science(), vol 6071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13541-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-13541-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13540-8
Online ISBN: 978-3-642-13541-5
eBook Packages: Computer ScienceComputer Science (R0)