9 citations · 13 across the 5 of their papers we have counts for
6 papers · 1 filter
Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line
Umang Bhaskar, Soumyajit Pyne
In Hotelling's model of spatial competition, a unit mass of voters is distributed in the interval (with their location corresponding to their political persuasion), and eac…
Optimal Bounds on the Price of Fairness for Indivisible Goods
Siddharth Barman, Umang Bhaskar, Nisarg Shah
In the allocation of resources to a set of agents, how do fairness guarantees impact the social welfare? A quantitative measure of this impact is the price of fairness, which measu…
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations
Siddharth Barman, Umang Bhaskar, Anand Krishna +1
We develop polynomial-time algorithms for the fair and efficient allocation of indivisible goods among agents that have subadditive valuations over the goods. We first consider…
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…
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…
Computing Optimal Tolls in Routing Games without Knowing the Latency Functions
Siddharth Barman, Umang Bhaskar, Chaitanya Swamy
We consider the following question: in a nonatomic routing game, can the tolls that induce the minimum latency flow be computed without knowing the latency functions? Since the lat…