On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture

2021/11/13 by Gurvich, Vladimir
#91A05 #91A06 #91A15 #91A18 #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.2111.07177

Abstract

We formulate a conjecture from graph theory that is equivalent to Nash-solvability of the finite two-person shortest path games with positive local costs. For the three-person games such conjecture fails.

Related

• Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
• On the shortest path game: extended version
• Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
• On Nash-Solvability of Finite Two-Person Tight Vector Game Forms
• Nash equilibria in Voronoi games on graphs