Partizan Poset Games

Sammanfattning: This thesis analyzes a class of element-removal partizan games played on colored posets. In these games a player moves by removing an element of its color together with all greater elements in the poset. A player loses if it has no elements left to remove. It is shown that all such games are numbers and that the dominating game options are to remove elements not lower than any other element of the same color. In particular, the thesis concerns games played on posets that are chess-colored Young diagrams. It is shown that it is easy to compute the value for any such game with < 3 rows by proving a proposed formula for computing the value.