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

11/13/2021
by   Vladimir Gurvich, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset