A game on a graph is a two-player game where a token moves along edges. Players alternate turns, moving the token from one vertex to an adjacent vertex. The player who cannot move loses.
On a DAG, you can classify each position by working backward from terminal nodes (vertices with no outgoing edges). Terminal positions are losing positions because the player whose turn it is has no move. From there, you label each vertex as winning or losing based on its successors.