Sciweavers

CIE
2008
Springer

Deterministic Graphical Games Revisited

14 years 27 days ago
Deterministic Graphical Games Revisited
We revisit the deterministic graphical games of 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.
Daniel Andersson, Kristoffer Arnsfelt Hansen, Pete
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where CIE
Authors Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Comments (0)