Abstract. We consider the complexity of determining the winner of a finite, two-level poset game. This is a natural question, as it has been shown recently ...

Jan 31, 2013 · Abstract. We consider the complexity of determining the winner of a finite, two-level poset game. This is a natural question, as it has been ...

We give a simple formula allowing one to compute the status of a type of two-level poset game that we call parity-uniform. This class includes significantly ...

Jan 1, 2022 · We also establish general equivalences between various two-level games. These equivalences imply that for any n , only finitely many two-level ...

We make some progress and give a simple formula allowing one to compute the status of a type of two-level poset game that we call parity-uniform in polynomial ...

Thus, one of my goals for this research is to determine definitively. I first plan to look for patterns in two-level poset games by investigating poset games ...

complexity of two-level poset games in the remaining two sections. We show that some special classes of two-level poset games can be decided in polynomial time.

This class includes significantly more easily solvable two-level games than was known previously. We also establish general equivalences between various two- ...

This introduction develops the fundamentals of combinatorial game theory and focuses for the most part on poset games, of which Nim is perhaps the ...

We study the complexity of computing winning strategies for poset games; these are two player games on finite partially ordered sets that were already studied.