Abstract-We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel and solving for each support the corresponding multilinear equations giving the candidate equilibria. We implemented the proposed algorithm using MPI on a cluster of computers. We performed extensive experiments on random games to show the performance of the parallel algorithm.
Lastly, Widger and Grosu REF proposed a parallel algorithm for computing Nash equilibria in n-player games based on polynomial continuation methods.
Parallel Computation of Nash Equilibria in N-Player Games
2009 International Conference on Computational Science and Engineering
2009 International Conference on Computational Science and Engineering
Computer Science