Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies

Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1

We prove that every finite two-person shortest path game, where the local cost of every move is positive for each player, has a Nash equilibrium (NE) in pure stationary strategies,…