On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
From MaRDI portal
Publication:1414826
DOI10.1016/S0165-4896(03)00077-5zbMath1071.91009OpenAlexW1984807749MaRDI QIDQ1414826
Endre Boros, Vladimir A. Gurvich
Publication date: 4 December 2003
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-4896(03)00077-5
Related Items (15)
Equilibria in nonantagonistic positional games on graphs and searching for them ⋮ Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic \(c\)-games on networks ⋮ An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension ⋮ Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ 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 Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Unnamed Item ⋮ Chess-like games may have no uniform Nash equilibria even in mixed strategies ⋮ A three-person deterministic graphical game without Nash equilibria ⋮ Acyclicity of improvements in finite game forms ⋮ On acyclicity of games with cycles ⋮ Unnamed Item ⋮ Monotone bargaining is Nash-solvable ⋮ On Acyclicity of Games with Cycles
Cites Work
- Cyclical games with prohibitions
- On stochastic games with additive reward and transition structure
- Fictitious play applied to sequences of games and discounted stochastic games
- Positional strategies for mean payoff games
- Borel determinacy
- Extensions of two person zero sum games
- A characterization of the minimum cycle mean in a digraph
- Cyclic Markov equilibria in stochastic games
- Perfect information stochastic games and related classes
- Stochastic games with non-absorbing states.
- Two-player stochastic games. I: A reduction
- A subexponential randomized algorithm for the simple stochastic game problem
- Optimal paths in network games with \(p\) players
- An extension of Borel determinacy
- Mean Cost Cyclical Games
- Contributions to the Theory of Games (AM-28), Volume II
- A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
- Stochastic games have a value
- Tight cyclic game forms
- Two-Commodity Flow
- Depth-First Search and Linear Graph Algorithms
- Stochastic Games
- Stochastic games
- Zermelo and the early history of game theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
