论文信息 - Nash equilibria detection for multi-player games

Nash equilibria detection for multi-player games

One of the main issues in computational game theory is equilibria detection in multi player games. This problem is approached using a generative relation for strategy profiles and two different search operators: crowding based differential evolution and a simple stepping stone reinforcing search algorithm. A probabilistic generative relation is also derived in order to tackle a higher number of players. Each approach has advantages and disadvantages, illustrated by numerical experiments for games involving from two to a hundred players.

Dumitru Dumitrescu | Rodica Ioana Lung | Tudor Dan Mihoc

[1] Kalyanmoy Deb,et al. A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[2] Andrew F. Daughety,et al. Cournot Oligopoly: Characterization and Applications , 1989 .

[3] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[4] R. McKelvey,et al. Computation of equilibria in finite games , 1996 .

[5] R. Storn,et al. Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[6] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[7] Hisao Ishibuchi,et al. Evolutionary many-objective optimization , 2008, 2008 3rd International Workshop on Genetic and Evolving Systems.

[8] René Thomsen,et al. Multimodal optimization using crowding-based differential evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).