Computing Strong Nash Equilibria for Multiplayer Games

TL;DR

This paper introduces a heuristic method using differential evolution to compute strong Nash equilibria in multiplayer games, demonstrating efficiency through experiments on large-scale games with up to 150 players.

Contribution

It presents a novel heuristic approach based on differential evolution and generative relations for identifying strong Nash equilibria in complex multiplayer games.

Findings

Effective in large games with up to 150 players

Different variants show trade-offs between precision and speed

Method outperforms existing approaches in certain scenarios

Abstract

An heuristic approach to compute strong Nash (Aumann) equilibria is presented. The method is based on differential evolution and three variants of a generative relation for strong Nash equilibria characterization. Numerical experiments performed on the minimum effort game for up to 150 players illustrate the efficiency of the approach. The advantages and disadvantages of each variant is discussed in terms of precision and running time.