Abstract
We consider a distributed system modeled by the second-order Cellular Automata (CA) and interpreted as a multi-agent system, where interactions between agents are defined by a spatial Prisoner’s Dilemma game. The idea of the second-order CA is based on the concept “adapt to the best neighbor. Each agent uses some strategy for the selection of actions used against opponents and can change it during the iterated game. An agent acts in such a way to maximize its income. We intend to study conditions of emerging collective behavior in such systems measured by the average total payoff of agents in the game or by an equivalent measure–the total number of cooperating players. These measures are the external criterion of the game, and players acting selfishly are not aware of them. We show experimentally that collective behavior in such systems can emerge if some conditions related to the game are fulfilled. We propose to introduce an income sharing mechanism to the game, giving a possibility to share incomes locally by agents. We present the results of an experimental study showing that the sharing mechanism is a distributed optimization algorithm that significantly improves the capabilities of emerging collective behavior on a wide range of the game parameters.
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
References
Brambilla, M., Ferrante, E., Birattari, M., Dorigo, M.: Swarm robotics: a review from the swarm engineering perspective. Swarm Intell. 7(1), 1–41 (2013)
Fernández Domingos, E., et al.: Emerging cooperation in N-Person iterated Prisoner’s dilemma over dynamic complex networks. Comput. Inform. 36, 493–516 (2017)
Gąsior, J., Seredyński, F.: Security-aware distributed job scheduling in cloud computing systems: a game-theoretic cellular automata-based approach. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11537, pp. 449–462. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-22741-8_32
Ishibuchi, H., Namikawa, N.: Evolution of iterated prisoner’s dilemma game strategies in structured demes under random pairing in game playing. IEEE Trans. Evol. Comput. 9(6), 552–561 (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). https://doi.org/10.1007/978-3-540-79992-4_8
Khaluf, Y., Ferrante, E., Simoens, P., Huepe, C.: Scale invariance in natural and artificial collective systems: a review. J. R. Soc. Interface 14, 20170662 (2017)
Nowak, M.A., May, R.M.: Evolutionary games and spatial chaos. Nature 359, 826 (1992)
Osborne, M.: An Introduction to Game Theory. Oxford University Press, New York (2009)
Peleteiro, A., Burguillo, J.C., Bazzan, A.L.: Emerging cooperation in the spatial IPD with reinforcement learning and coalitions. In: Bouvry, P., González-Vélez, H., Kołodziej, J. (eds.) Intelligent Decision Systems in Large-Scale Distributed Environments. Studies in Computational Intelligence, vol. 362, pp. 187–206. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21271-0_9
Rossi, F., Bandyopadhyay, S., Wolf, M., Pavone, M.: Review of multi-agent algorithms for collective behavior: a structural taxonomy. IFAC-PapersOnLine 51(12), 112–117 (2018). IFAC Workshop on Networked & Autonomous Air & Space Systems NAASS 2018
Seredynski, F.: Loosely coupled distributed genetic algorithms. In: Davidor, Y., Schwefel, H.-P., Männer, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 514–523. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58484-6_294
Seredyński, F.: Competitive coevolutionary multi-agent systems: the application to mapping and scheduling problems. J. Parallel Distrib. Comput. 47(1), 39–57 (1997)
Seredyński, F., Gąsior, J.: Collective behavior of large teams of multi-agent systems. In: De La Prieta, F., et al. (eds.) PAAMS 2019. CCIS, vol. 1047, pp. 152–163. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24299-2_13
Seredyński, F., Gąsior, J.: Collective behavior of large teams of multi-agent systems. In: Highlights of Practical Applications of Survivable Agents and Multi-Agent Systems. The PAAMS Collection - International Workshops of PAAMS 2019, Ávila, Spain, 26–28 June 2019, Proceedings, pp. 152–163 (2019)
Tretyakova, A., Seredynski, F., Bouvry, P.: Graph cellular automata approach to the maximum lifetime coverage problem in wireless sensor networks. Simulation 92(2), 153–164 (2016)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Östberg, P., Byrne, J., et al.: Reliable capacity provisioning for distributed cloud/edge/fog computing applications. In: 2017 European Conference on Networks and Communications (EuCNC), pp. 1–6, June 2017
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Seredyński, F., Gąsior, J. (2020). Behavior Optimization in Large Distributed Systems Modeled by Cellular Automata. In: Bäck, T., et al. Parallel Problem Solving from Nature – PPSN XVI. PPSN 2020. Lecture Notes in Computer Science(), vol 12269. Springer, Cham. https://doi.org/10.1007/978-3-030-58112-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-030-58112-1_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58111-4
Online ISBN: 978-3-030-58112-1
eBook Packages: Computer ScienceComputer Science (R0)