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.