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.011zbMATH Open1235.91009DBLPjournals/dm/BorosEGM12OpenAlexW2013992407WikidataQ59560521 ScholiaQ59560521MaRDI QIDQ409428FDOQ409428

Endre Boros, Kazuhisa Makino, Vladimir Gurvich, Khaled 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

Recommendations

• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Chess-like games may have no uniform Nash equilibria even in mixed strategies
• Nash-solvable two-person symmetric cycle game forms
• On acyclicity of games with cycles
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost

zbMATH Keywords

moveNash equilibriumstochastic gameperfect informationbest replychess- and backgammon-like gamesimprovement cyclepositionrandom movesubgame perfect

Mathematics Subject Classification ID

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

Cites Work

• The complexity of stochastic games
• Non-cooperative games
• Equilibrium points in n -person games
• Subgame Perfection in Positive Recursive Games with Perfect Information
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum-Minimum Sätze über Graphen
• Discrete Dynamic Programming
• 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
• Stochastic Games with Perfect Information and Time Average Payoff
• 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
• A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
• A stochastic game with complete information and without equilibrium situations in pure stationary strategies
• Tight cyclic game forms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Notes on the Theory of Series (XVI): Two Tauberian Theorems
• Title not available (Why is that?)
• Acyclicity of improvements in finite game forms
• Extensive Games
• A Theory of N -Person Games with Perfect Information
• Deterministic Graphical Games Revisited
• Zermelo and the early history of game theory
• Nash-solvable two-person symmetric cycle game forms
• Perfect information and potential games
• On acyclicity of games with cycles
• Cyclic games and linear programming

Cited In (17)

• Title not available (Why is that?)
• On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
• On Acyclicity of Games with Cycles
• Nash-solvable two-person symmetric cycle game forms
• On acyclicity of games with cycles
• Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Equilibria in nonantagonistic positional games on graphs and searching for them
• 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
• Title not available (Why is that?)
• A semi-potential for finite and infinite games in extensive form
• Well-founded extensive games with perfect information
• A nested family of \(k\)-total effective rewards for positional games
• Title not available (Why is that?)
• Grafos y Juegos den personas

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409428)