On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games

DOI10.1016/j.disc.2011.11.011zbMath1235.91009OpenAlexW2013992407WikidataQ59560521 ScholiaQ59560521MaRDI QIDQ409428

Endre Boros, Kazuhisa Makino, Vladimir A. Gurvich, Khaled M. Elbassioni

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.011

zbMATH Keywords

moveNash equilibriumpositionperfect informationstochastic gamebest replychess- and backgammon-like gamesimprovement cyclerandom movesubgame perfect

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)

Related Items (9)

Equilibria in nonantagonistic positional games on graphs and searching for them ⋮ A semi-potential for finite and infinite games in extensive form ⋮ Unnamed Item ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Chess-like games may have no uniform Nash equilibria even in mixed strategies ⋮ A three-person deterministic graphical game without Nash equilibria ⋮ A nested family of \(k\)-total effective rewards for positional games ⋮ Unnamed Item

Cites Work

• Acyclicity of improvements in finite game forms
• Nash-solvable two-person symmetric cycle game forms
• Perfect information and potential games
• On acyclicity of games with cycles
• Cyclic games and linear programming
• The complexity of stochastic games
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Backward induction and the game-theoretic analysis of chess.
• Deterministic graphical games
• Non-cooperative games
• Subgame Perfection in Positive Recursive Games with Perfect Information
• Maximum-Minimum Sätze über Graphen
• A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
• The Complexity of Solving Stochastic Games on Graphs
• A stochastic game with complete information and without equilibrium situations in pure stationary strategies
• Tight cyclic game forms
• Notes on the Theory of Series (XVI): Two Tauberian Theorems
• Discrete Dynamic Programming
• Stochastic Games with Perfect Information and Time Average Payoff
• Equilibrium points in n -person games
• Extensive Games
• A Theory of N -Person Games with Perfect Information
• Deterministic Graphical Games Revisited
• Zermelo and the early history of game theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games