Poset Games are PSPACE-complete Computational Complexity, 20 Sep 2012 Consider the following game on a poset, each player takes turns picking an element x of a finite poset and removes all y ≥ x.