Deterministic Graphical Games Revisited

Authors:
Daniel Andersson;Kristoffer Arnsfelt Hansen;Peter Bro Miltersen;Troels Bjerre Sørensen
Affiliations:
Datalogisk Institut, University of Aarhus, Aarhus N, Denmark DK-8200;Datalogisk Institut, University of Aarhus, Aarhus N, Denmark DK-8200;Datalogisk Institut, University of Aarhus, Aarhus N, Denmark DK-8200;Datalogisk Institut, University of Aarhus, Aarhus N, Denmark DK-8200
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 11
Cited 2

Algorithms for two bottleneck optimization problems

Journal of Algorithms
The complexity of stochastic games

Information and Computation
The complexity of mean payoff games on graphs

Theoretical Computer Science
A fast algorithm for a class of bottleneck problems

Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On model checking for the &mgr;-calculus and its fragments

Theoretical Computer Science
Graphical Models for Game Theory

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Linear time bounds for median computations

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence)

Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence)
Solving Awari with Parallel Retrograde Analysis

Computer

The Complexity of Solving Stochastic Games on Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Solving simple stochastic games with few coin toss positions

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We revisit the deterministic graphical gamesof Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving deterministic graphical games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium of such a game. The existence of a linear time comparison-based algorithm remains an open problem.