Abstract
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.
Research supported by Center for Algorithmic Game Theory, funded by The Carlsberg Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M., Komlós, J., Szemerédi, E.: An O(n logn) sorting network. In: Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pp. 1–9 (1983)
Aumann, R.J.: Presidential address at the First International Congress of the Game Theory Society. Games and Economic Behavior 45, 2–14 (2003)
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Linear time bounds for median computations. In: Proceedings of the 4th Annual ACM Symposium on the Theory of Computing, pp. 119–124 (1972)
Condon, A.: The complexity of stochastic games. Information and Computation 96, 203–224 (1992)
Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the μ-calculus and its fragments. Theor. Comput. Sci. 258(1-2), 491–522 (2001)
Everett, H.: Recursive games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematical Studies, vol. III(39), Princeton University Press, Princeton (1957)
Gabow, H.N., Tarjan, R.E.: Algorithms for two bottleneck optimization problems. J. Algorithms 9, 411–417 (1988)
Heinz, E.A.: Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths. Morgan Kaufmann Publishers Inc., San Francisco (1999)
Kearns, M., Littman, M.L., Singh, S.: Graphical models for game theory. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 253–260 (2001)
Knuth, D.E.: The Art of Computer Programming, 3rd edn. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1997)
Punnen, A.P.: A fast algorithm for a class of bottleneck problems. Computing 56, 397–401 (1996)
Romein, J., Bal, H.: Solving the game of awari using parallel retrograde analysis. IEEE Computer 36(10), 26–33 (2003)
Thompson, K.: Retrograde analysis of certain endgames. Journal of the International Computer Chess Association 9(3), 131–139 (1986)
Vieille, N.: Two-player stochastic games I: A reduction. Israel Journal of Mathematics 119, 55–91 (2000)
Vieille, N.: Two-player stochastic games II: The case of recursive games. Israel Journal of Mathematics 119, 93–126 (2000)
Washburn, A.R.: Deterministic graphical games. Journal of Mathematical Analysis and Applications 153, 84–96 (1990)
Zwick, U., Paterson, M.S.: The complexity of mean payoff games on graphs. Theoretical Computer Science 158(1–2), 343–359 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersson, D., Hansen, K.A., Miltersen, P.B., Sørensen, T.B. (2008). Deterministic Graphical Games Revisited. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)