Equilibria in nonantagonistic positional games on graphs and searching for them
From MaRDI portal
Publication:1642049
DOI10.1134/S0005117918020145zbMath1395.91056OpenAlexW2790466932WikidataQ130189846 ScholiaQ130189846MaRDI QIDQ1642049
Publication date: 20 June 2018
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117918020145
Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- Acyclicity of improvements in finite game forms
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Cyclic games and an algorithm to find minimax cycle means in directed graphs