Authorization

 

Journal

Volume 7, №1


Nash equilibria solutions in the competitive salesmen problem on a network (pages 54-65)
I. Averbakh, V. Lebedev, V. Tsurkov


Abstract. We consider the problem of searching for Nash equilibria solutions for optimal routing of competing servers on a transportation network. The servers compete for customers located at nodes of the network. The server that reaches a customer first gets the profit from this customer. We provide efficient polynomial algorithms and complexity analysis for different versions of this problem.


Keywords: Polynomial Algorithm, NP-Hardness, Nash Equilibrium, Traveling Salesman.



COIA 2027

7-9 July 2027
Baku, Azerbaijan

Search