Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies.
Endre BorosPaolo Giulio FranciosaVladimir GurvichMichael N. VyalyiPublished in: CoRR (2022)
Keyphrases
- nash equilibria
- shortest path
- mixed strategy
- solution concepts
- stochastic games
- incomplete information
- nash equilibrium
- fictitious play
- game theory
- pure strategy
- shortest path problem
- game theoretic
- shortest path algorithm
- road network
- path length
- normal form games
- non stationary
- optimal path
- weighted graph
- flow graph
- shortest distance
- multiagent learning
- genetic algorithm
- evolutionary game theory
- steiner tree
- multi objective