2 problems

A finite deterministic graphical game (DG game) with a unique cyclic outcome is considered, together with the rank vector $r$ whose entry $r_i$ counts the terminal outcomes that ar…

Let an $n$-person deterministic graphical game be play-once if every player makes at most one move during a play. The game is Nash-solvable if it has a Nash equilibrium in pure sta…