On equilibria in finite games

DOI10.1007/BF01768703zbMath0424.90091WikidataQ29029911 ScholiaQ29029911MaRDI QIDQ1135218

V. Bubelis

Publication date: 1979

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

zbMATH Keywords

equilibrium manifoldNash equilibrium pointscompletely mixed game3-person gamedesign of gamesn-person noncooperative games

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (12)

Projections and functions of Nash equilibria ⋮ A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ Robust games: theory and application to a Cournot duopoly model ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form ⋮ Zero-Sum Two Person Games ⋮ The real computational complexity of minmax value and equilibrium refinements in multi-player games ⋮ Universality of Nash components ⋮ On the topology of the set of Nash equilibria ⋮ Game logic and its applications. I ⋮ Discrete versions of the KKM lemma and their PPAD-completeness ⋮ A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games

Cites Work

• Structure of equilibria in N-person non-cooperative games
• Equilibrium Points of Bimatrix Games
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On equilibria in finite games