Computer Science 789 Online Algorithms

Hint 3 for the Proof of the Game Graph Lemma

Getting a path set strategy P from a behavioral strategy S.

If S is a behavioral strategy, let P be the set of all paths alpha which satisfy the condition that, if beta is a prefix of alpha which ends at a red node x then the next node of alpha following x is S(beta).

Back to Course Page

Back to Assignment Page

Back to Assignment 1