2 papers
cs.GT2019
Computational Aspects of Equilibria in Discrete Preference Games
Phani Raj Lolakapuri, Umang Bhaskar, Ramasuri Narayanam +2
We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decisi…
cs.GT2018
Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions
Umang Bhaskar, Phani Raj Lolakapuri
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. The…