Abstract
A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the poset loses. Polynomial time algorithms exist for certain restricted classes of poset games, such as the game of Nim. However, until recently the complexity of arbitrary finite poset games was only known to exist somewhere between NC 1 and PSPACE. We resolve this discrepancy by showing that deciding the winner of an arbitrary finite poset game is PSPACE-complete. To this end, we give an explicit reduction from Node Kayles, a PSPACE-complete game in which players vie to chose an independent set in a graph.
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
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 1. AK Peters (2004)
Bouton, C.L.: Nim, a game with a complete mathematical theory. The Annals of Mathematics 3(1/4), 35–39 (1901)
Byrnes, S.: Poset game periodicity. Integers: Electronic Journal of Combinatorial Number Theory 3(G03), 2 (2003)
Deuber, W., Thomassé, S.: Grundy Sets of Partial Orders (1996)
Fenner, S., Gurjar, R., Korwar, A., Thierauf, T.: Two-level posets (2012) (manuscript)
Fortnow, L.: A simple PSPACE-complete problem, http://blog.computationalcomplexity.org/2012/11/a-simple-pspace-complete-problem.html
Fraenkel, A.S., Scheinerman, E.R.: A deletion game on hypergraphs. Discrete Applied Mathematics 30(2-3), 155–162 (1991)
Fraenkel, A.S.: Recent results and questions in combinatorial game complexities. Theoretical Computer Science 249(2), 265–288 (2000)
Fraenkel, A.S.: Complexity, appeal and challenges of combinatorial games. Theoretical Computer Science 313(3), 393–415 (2004)
Gale, D.: A curious Nim-type game. The American Mathematical Monthly 81(8), 876–879 (1974)
Gale, D., Neyman, A.: Nim-type games. International Journal of Game Theory 11(1), 17–20 (1982)
Ito, H., Takata, S.: PSPACE-completeness of the Weighted Poset Game (2011)
Kalinich, A.O.: Flipping the winner of a poset game. Information Processing Letters (2011)
Schaefer, T.J.: On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences (1978)
Schuh, F.: Spel van delers (The game of divisors). Nieuw Tijdschrift voor Wiskunde 39, 299–304 (1952)
Soltys, M., Wilson, C.: On the complexity of computing winning strategies for finite poset games. Theory of Computing Systems 48(3), 680–692 (2011)
Úlehla, J.: A complete analysis of Von Neumann’s Hackendot. International Journal of Game Theory 9(2), 107–113 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grier, D. (2013). Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)