Berge equilibria in n-person 2-strategy games

TL;DR

This paper presents an algorithm to identify all Berge equilibria in n-person 2-strategy games, applicable to both pure and mixed strategies, advancing solution methods in game theory.

Contribution

It introduces a novel algorithm specifically designed to find all Berge equilibria in multi-player 2-strategy games, expanding the computational tools available.

Findings

Algorithm successfully finds all Berge equilibria in tested scenarios.

Applicable to both pure and mixed strategy profiles.

Enhances understanding of equilibrium structures in multi-player games.

Abstract

An algorithm for finding all Berge equilibria in the sense of Zhukovskii in n-person 2-strategy games in pure and mixed strategies is given.