Deterministic Graphical Games Revisited

DOI10.1007/978-3-540-69407-6_1zbMath1142.91374OpenAlexW2108416232MaRDI QIDQ5900106

Kristoffer Arnsfelt Hansen, Troels Bjerre Sørensen, Peter Bro Miltersen, Daniel Andersson

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (3)

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 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• Two-player stochastic games. I: A reduction
• Two-player stochastic games. II: The case of recursive games
• A fast algorithm for a class of bottleneck problems
• Deterministic graphical games
• Contributions to the Theory of Games (AM-39), Volume III
• Algorithms for two bottleneck optimization problems
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Deterministic Graphical Games Revisited