Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions

26 Apr 2018 Bhaskar Umang Lolakapuri Phani Raj

We present polynomial-time algorithms as well as hardness results for equilibrium computation in atomic splittable routing games, for the case of general convex cost functions. These games model traffic in freight transportation, market oligopolies, data networks, and various other applications... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY