The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form

DOI10.1142/S021919891850010XzbMath1418.91032OpenAlexW2810829146MaRDI QIDQ4557743

H. W. Corley, Ahmad Nahhas

Publication date: 26 November 2018

Published in: International Game Theory Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021919891850010x

zbMATH Keywords

computational complexityNP-completemixed Berge equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• A mixed cooperative dual to the Nash equilibrium
• An algorithm for computing all Berge equilibria
• Mutual support in games: some properties of Berge equilibria
• New complexity results about Nash equilibria
• On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
• On the complexity of the parity argument and other inefficient proofs of existence
• A note on Berge equilibrium
• Non-cooperative games
• Settling the complexity of computing two-player Nash equilibria
• A Nonlinear Programming Approach to Determine a Generalized Equilibrium for N-Person Normal Form Games
• The Complexity of Computing a Nash Equilibrium

This page was built for publication: The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form