Element-Removal Games on Acyclic Graphs and Posets

Sammanfattning: This paper is about element-removal games on acyclic graphs and posets. Two players alternate in turn by removing one element at a time according to the rules. If a player on her turn cannot make a move she loses and the game ends. Here we give formulas for the game value of games on trees where the players are only allowed to remove leaves. We also show how to compute the game value of games on some posets whose Hasse diagram is cycle-free and the players must remove maximal and/or minimal elements.