Erik Järleberg: Pomax games: A new class of partizan games played on posets

In combinatorial game theory, poset games are impartial games played between two players on some given poset. Classical examples are the games of Nim and Chomp. While Nim is solved, not much is known about Chomp. In general it is PSPACE-complete to determine the winner of an arbitrary poset game. 

In this talk, we will present a new class of partizan games, called Pomax games, played on posets. Pomax games are a partizan version of regular poset games, with slightly perturbed rules.

We will show that all Pomax games are integer valued, and that it is NP-hard to determine the winner of an arbitrary Pomax game.  We will also show how to solve Pomax games played on trees and on chess-colored Young diagrams.