Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies.
Endre BorosPaolo Giulio FranciosaVladimir GurvichMikhail N. VyalyiPublished in: Int. J. Game Theory (2024)
Keyphrases
- nash equilibria
- shortest path
- mixed strategy
- solution concepts
- game theory
- pure strategy
- incomplete information
- nash equilibrium
- fictitious play
- stochastic games
- shortest path problem
- normal form games
- game theoretic
- shortest path algorithm
- non stationary
- road network
- shortest distance
- weighted graph
- flow graph
- optimal path
- finding the shortest path
- path length
- multiagent learning
- objective function
- directed graph
- congestion games
- dynamic environments