An algorithm for computing all Berge equilibria
From MaRDI portal
Publication:275883
DOI10.1155/2015/862842zbMath1335.91007OpenAlexW2027969106WikidataQ59104295 ScholiaQ59104295MaRDI QIDQ275883
Publication date: 26 April 2016
Published in: Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/862842
Related Items (8)
A mixed cooperative dual to the Nash equilibrium ⋮ Corrigendum to: ``An algorithm for computing all Berge equilibria ⋮ The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form ⋮ A Nonlinear Programming Approach to Determine a Generalized Equilibrium for N-Person Normal Form Games ⋮ On self- and other-regarding cooperation: Kant versus Berge ⋮ Berge equilibrium in linear-quadratic mean-field-type games ⋮ Berge equilibrium in normal form static games: a literature review ⋮ A Note on Berge Equilibria in n-Person 2-Strategy Games
Cites Work
This page was built for publication: An algorithm for computing all Berge equilibria