Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich +1

We prove that a deterministic n-person shortest path game has a Nash equlibrium in pure and stationary strategies if it is edge-symmetric (that is (u,v) is a move whenever (v,u) is…