Chess-like games may have no uniform Nash equilibria even in mixed strategies
From MaRDI portal
Publication:457857
DOI10.1155/2013/534875zbMath1305.91052OpenAlexW2146049888WikidataQ58919847 ScholiaQ58919847MaRDI QIDQ457857
Emre Yamangil, Endre Boros, Vladimir A. Gurvich
Publication date: 30 September 2014
Published in: Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/534875
Related Items (3)
On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ A three-person deterministic graphical game without Nash equilibria ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- Nash-solvable two-person symmetric cycle game forms
- On acyclicity of games with cycles
- Pure subgame-perfect equilibria in free transition games
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- On the solvability of Bellman's functional equation for a Markovian decision process
- Non-cooperative games
- Subgame Perfection in Positive Recursive Games with Perfect Information
- A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
- On Acyclicity of Games with Cycles
- A stochastic game with complete information and without equilibrium situations in pure stationary strategies
- The solvability of positional games in pure strategies
- Equilibrium points in n -person games
- Extensive Games
- A Theory of N -Person Games with Perfect Information
This page was built for publication: Chess-like games may have no uniform Nash equilibria even in mixed strategies
