MOVES-Seminar, 26 März 2008


Memory bounds for winning strategies in infinite games

 

Haidi Yue  (Info 7)

 

Abstract:

We consider two player infinite games on finitely colored game
graphs. We introduce the concept of Zielonka trees. It is known that
the number of leaves in the Zielonka tree of a Muller condition F is
sufficient as memory for strategies to solve games with this winning
condition.  We consider conjunctions of parity games and present a new
data structure called Priority Color Pair List (PCPL) inspired from
Zielonka trees. By applying PCPL we prove upper and lower bounds for
the memory size of strategies in such games.  We also consider games
with occurence winning conditions and show that only the class of weak
parity conditions permit memoryless winning strategies.