Berge equilibria in n-person 2-strategy games
Pawe{\l} Sawicki, Jaros{\l}aw Pykacz, Pawe{\l} Bytner

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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Evolutionary Game Theory and Cooperation · Business Strategy and Innovation
