Deterministic graphical games

DOI10.1016/0022-247X(90)90267-JzbMath0724.90098MaRDI QIDQ2277168

Alan R. Washburn

Publication date: 1990

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

perfect information; finite directed graphs; calculation of equilibria

Mathematics Subject Classification ID

91A05: 2-person games

91A43: Games involving graphs

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Deterministic Graphical Games Revisited, 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, Selfish cops and passive robber: qualitative games, Cycles in extensive form perfect information games, A three-person deterministic graphical game without Nash equilibria, Monotone bargaining is Nash-solvable, On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost, The Complexity of Nash Equilibria in Limit-Average Games

Cites Work

• Prohibiting repetitions makes playing games substantially harder
• Graphs and composite games
• Stochastic Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item