1 problem

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…