On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like n-person games
From MaRDI portal
(Redirected from Publication:409428)
On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
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
Cites work
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 21293 (Why is no real title available?)
- scientific article; zbMATH DE number 486435 (Why is no real title available?)
- scientific article; zbMATH DE number 497479 (Why is no real title available?)
- scientific article; zbMATH DE number 219978 (Why is no real title available?)
- scientific article; zbMATH DE number 3278986 (Why is no real title available?)
- scientific article; zbMATH DE number 3333895 (Why is no real title available?)
- scientific article; zbMATH DE number 3078991 (Why is no real title available?)
- A Theory of N -Person Games with Perfect Information
- A pumping algorithm for ergodic stochastic mean payoff games with perfect information
- A stochastic game with complete information and without equilibrium situations in pure stationary strategies
- A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
- Acyclicity of improvements in finite game forms
- Backward induction and the game-theoretic analysis of chess.
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Cyclic games and linear programming
- Deterministic Graphical Games Revisited
- Deterministic graphical games
- Discrete Dynamic Programming
- Equilibrium points in n -person games
- Extensive Games
- Maximum-Minimum Sätze über Graphen
- Nash-solvable two-person symmetric cycle game forms
- Non-cooperative games
- Notes on the Theory of Series (XVI): Two Tauberian Theorems
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- On acyclicity of games with cycles
- Perfect information and potential games
- Stochastic Games with Perfect Information and Time Average Payoff
- Subgame perfection in positive recursive games with perfect information
- The complexity of solving stochastic games on graphs
- The complexity of stochastic games
- Tight cyclic game forms
- Zermelo and the early history of game theory
Cited in
(18)- scientific article; zbMATH DE number 59559 (Why is no real title available?)
- Nash-solvable two-person symmetric cycle game forms
- Backward induction in presence of cycles
- A semi-potential for finite and infinite games in extensive form
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- A three-person deterministic graphical game without Nash equilibria
- Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
- On acyclicity of games with cycles
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
- A semi-potential for finite and infinite sequential games (extended abstract)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- Well-founded extensive games with perfect information
- A nested family of \(k\)-total effective rewards for positional games
- Equilibria in nonantagonistic positional games on graphs and searching for them
- On Acyclicity of Games with Cycles
- Grafos y Juegos den personas
- Chess-like games may have no uniform Nash equilibria even in mixed strategies
- scientific article; zbMATH DE number 7533335 (Why is no real title available?)
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)
