On the existence of almost-pure-strategy Nash equilibrium in \(n\)-person finite games

DOI10.1007/s00186-006-0105-1zbMath1152.91327OpenAlexW2019924637MaRDI QIDQ2466773

Wojciech Połowczuk, Tadeusz Radzik, Piotr Wiȩcek

Publication date: 16 January 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-006-0105-1

zbMATH Keywords

Nash equilibriumNoncooperative gamesConvex payoffsMatrix gamesTwo-point strategies

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (2)

SIMPLE EQUILIBRIA IN SEMI-INFINITE GAMES ⋮ Poor convexity and Nash equilibria in games

Cites Work

• Saddle point theorems
• Games with convex payoff function in the first variable
• Equilibria of continuous two-person games
• Characterization of optimal strategies in matrix games with convexity properties
• Pure Nash equilibria in finite two-person non-zero-sum games
• Nash equilibria of discontinuous non-zero-sum two-person games
• Non-cooperative games
• On two-point Nash equilibria in bimatrix games with convexity properties
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points

This page was built for publication: On the existence of almost-pure-strategy Nash equilibrium in \(n\)-person finite games