Solving optimization problems by the public goods game

Abstract We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

[1]  P. Anderson.  More is different. , 1972, Science.

[2]  Attila Szolnoki,et al.  Wisdom of groups promotes cooperation in evolutionary social dilemmas , 2012, Scientific Reports.

[3]  Elena Agliari,et al.  Optimization strategies with resource scarcity: From immunization of networks to the traveling salesman problem , 2015 .

[4]  Giorgio Parisi,et al.  Quantitative field theory of the glass transition , 2012, Proceedings of the National Academy of Sciences.

[5]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[6]  M. Mézard,et al.  On the statistical mechanics of optimization problems of the travelling salesman type , 1984 .

[7]  L. Peliti,et al.  Opinion dynamics in a three-choice system , 2005, cond-mat/0504254.

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Guilhem Semerjian,et al.  First-order transitions and the performance of quantum algorithms in random optimization problems , 2009, Physical review letters.

[10]  Naoki Masuda,et al.  Evolution of cooperation driven by zealots , 2012, Scientific Reports.

[11]  J. Gómez-Gardeñes,et al.  Evolutionary game dynamics in a growing structured population , 2009, 0907.2649.

[12]  Leandro Nunes de Castro,et al.  Fundamentals of natural computing: an overview , 2007 .

[13]  Daniel J. Amit,et al.  Modeling brain function: the world of attractor neural networks, 1st Edition , 1989 .

[14]  Daniel I. S. Rosenbloom,et al.  Imitation dynamics of vaccination behaviour on social networks , 2011, Proceedings of the Royal Society B: Biological Sciences.

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  A. Traulsen,et al.  From genes to games: cooperation and cyclic dominance in meiotic drive. , 2012, Journal of theoretical biology.

[17]  Florent Krzakala,et al.  Statistical physics of inference: thresholds and algorithms , 2015, ArXiv.

[18]  Attila Szolnoki,et al.  Evolutionary dynamics of group interactions on structured populations: a review , 2013, Journal of The Royal Society Interface.

[19]  M. A. Cayless.  Statistical Mechanics (2nd edn) , 1977 .

[20]  E. Fehr,et al.  Altruistic punishment in humans , 2002, Nature.

[21]  Carlo Baldassi,et al.  Statistical Physics and Network Optimization Problems , 2015 .

[22]  M. Nowak.  Evolutionary Dynamics: Exploring the Equations of Life , 2006 .

[23]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[24]  Marco Alberto Javarone,et al.  An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems , 2016, ArXiv.

[25]  J Gómez-Gardeñes,et al.  Social network reciprocity as a phase transition in evolutionary cooperation. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Matjaz Perc,et al.  Collective behavior and evolutionary games - An introduction , 2013, 1306.2296.

[27]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[28]  S. Redner,et al.  Voter model on heterogeneous graphs. , 2004, Physical review letters.

[29]  Martin S. Kochma'nski,et al.  Curie–Weiss magnet—a simple model of phase transition , 2013, 1301.2141.

[30]  E. M.,et al.  Statistical Mechanics , 2021, Manual for Theoretical Chemistry.

[31]  M. Nowak,et al.  Evolutionary games and spatial chaos , 1992, Nature.

[32]  A. Barra,et al.  Mean field spin glasses treated with PDE techniques , 2013 .

[33]  H. Kellerer,et al.  Introduction to NP-Completeness of Knapsack Problems , 2004 .

[34]  Attila Szolnoki,et al.  Reward and cooperation in the spatial public goods game , 2010, ArXiv.

[35]  Marco Alberto Javarone,et al.  Conformity-driven agents support ordered phases in the spatial public goods game , 2016, 1602.01808.

[36]  Riccardo Zecchina,et al.  Stochastic optimization by message passing , 2011, ArXiv.

[37]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[38]  M. Perc,et al.  Social diversity and promotion of cooperation in the spatial prisoner's dilemma game. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[40]  Elena Agliari,et al.  Hierarchical neural networks perform both serial and parallel processing , 2014, Neural Networks.

[41]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[42]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[43]  Péter Érdi,et al.  Challenges in complex systems science , 2012, ArXiv.

[44]  M. Nowak.  Five Rules for the Evolution of Cooperation , 2006, Science.