Umang Bhaskar

According to our database1, Umang Bhaskar authored at least 35 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line.
CoRR, 2024

Nearly Equitable Allocations beyond Additivity and Monotonicity.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
The Price of Equity with Binary Valuations and Few Agent Types.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2021
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources.
Proceedings of the Approximation, 2021

2020
Settling the Price of Fairness for Indivisible Goods.
CoRR, 2020

Optimal Bounds on the Price of Fairness for Indivisible Goods.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Partial Function Extension with Applications to Learning and Property Testing.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

A Non-Extendibility Certificate for Submodularity and Applications.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Achieving target equilibria in network routing games without knowing the latency functions.
Games Econ. Behav., 2019

Computational Aspects of Equilibria in Discrete Preference Games.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

The Complexity of Partial Function Extension for Coverage Functions.
Proceedings of the Approximation, 2019

2018
Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions.
CoRR, 2018

On the Welfare of Cardinal Voting Mechanisms.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Equilibrium Computation in Atomic Splittable Routing Games.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Algorithms for Inverse Optimization Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2016
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Adwords Problem with Strict Capacity Constraints.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games.
Math. Oper. Res., 2015

A Stackelberg strategy for routing flow over time.
Games Econ. Behav., 2015

Online Budgeted Repeated Matching.
CoRR, 2015

Near-Optimal Hardness Results for Signaling in Bayesian Games.
CoRR, 2015

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions.
CoRR, 2015

2014
Network improvement for equilibrium routing.
SIGecom Exch., 2014

On the Existence of Low-Rank Explanations for Mixed Strategy Behavior.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Network Improvement for Equilibrium Routing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013
The Network Improvement Problem for Equilibrium Routing.
CoRR, 2013

The Complexity of Nash Equilibria as Revealed by Data.
CoRR, 2013

Online Mixed Packing and Covering.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The empirical implications of rank in Bimatrix games.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
Online Mixed Packing and Covering
CoRR, 2012

2011
A competitive strategy for routing flow over time.
SIGecom Exch., 2011

2010
The Price of Collusion in Series-Parallel Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Equilibria of atomic flow games are not unique.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009


  Loading...