An algorithm for computing all Berge equilibria
From MaRDI portal
Recommendations
- Existence and computation of Berge equilibrium and of two refinements
- A NEW THEOREM TO FIND BERGE EQUILIBRIA
- Weak Berge equilibrium
- The computational complexity of finding a mixed Berge equilibrium for a \(k\)-person noncooperative game in normal form
- A note on anti-Berge equilibrium for bimatrix game
Cites work
- scientific article; zbMATH DE number 6476641 (Why is no real title available?)
- scientific article; zbMATH DE number 3135405 (Why is no real title available?)
- A NEW THEOREM TO FIND BERGE EQUILIBRIA
- A note on Berge equilibrium
- Berge-Vaisman and Nash equilibria: transformation of games
- Equilibrium points in n -person games
- Mutual support in games: some properties of Berge equilibria
- Some existence theorems of Nash and Berge equilibria.
Cited in
(9)- A mixed cooperative dual to the Nash equilibrium
- The computational complexity of finding a mixed Berge equilibrium for a \(k\)-person noncooperative game in normal form
- Matrix representations of Berge stabilities in the graph model for conflict resolution
- A Note on Berge Equilibria in n-Person 2-Strategy Games
- On self- and other-regarding cooperation: Kant versus Berge
- Berge equilibrium in normal form static games: a literature review
- Corrigendum to: ``An algorithm for computing all Berge equilibria
- A Nonlinear Programming Approach to Determine a Generalized Equilibrium for N-Person Normal Form Games
- Berge equilibrium in linear-quadratic mean-field-type games
This page was built for publication: An algorithm for computing all Berge equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q275883)
