Umang Bhaskar

According to our database, Umang Bhaskar authored at least 34 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Nearly Equitable Allocations beyond Additivity and Monotonicity.

Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

The Price of Equity with Binary Valuations and Few Agent Types.

Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2021

On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources.

Umang Bhaskar, A. R. Sricharan, Rohit Vaish

Proceedings of the Approximation, 2021

2020

Settling the Price of Fairness for Indivisible Goods.

Siddharth Barman, Umang Bhaskar, Nisarg Shah

CoRR, 2020

Optimal Bounds on the Price of Fairness for Indivisible Goods.

Siddharth Barman, Umang Bhaskar, Nisarg Shah

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Partial Function Extension with Applications to Learning and Property Testing.

Umang Bhaskar, Gunjan Kumar

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations.

Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

A Non-Extendibility Certificate for Submodularity and Applications.

Umang Bhaskar, Gunjan Kumar

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Achieving target equilibria in network routing games without knowing the latency functions.

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy

Games Econ. Behav., 2019

Computational Aspects of Equilibria in Discrete Preference Games.

Phani Raj Lolakapuri, Umang Bhaskar, Ramasuri Narayanam, Gyana R. Parija, Pankaj S. Dayama

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

The Complexity of Partial Function Extension for Coverage Functions.

Umang Bhaskar, Gunjan Kumar

Proceedings of the Approximation, 2019

2018

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

Umang Bhaskar, Phani Raj Lolakapuri

CoRR, 2018

On the Welfare of Cardinal Voting Mechanisms.

Umang Bhaskar, Abheek Ghosh

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Equilibrium Computation in Atomic Splittable Routing Games.

Umang Bhaskar, Phani Raj Lolakapuri

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Algorithms for Inverse Optimization Problems.

Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections.

Umang Bhaskar, Varsha Dani, Abheek Ghosh

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2016

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.

Umang Bhaskar, Yu Cheng, Young Kun Ko, Chaitanya Swamy

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Adwords Problem with Strict Capacity Constraints.

Umang Bhaskar, Ajil Jalal, Rahul Vaze

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.

Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang

Math. Oper. Res., 2015

A Stackelberg strategy for routing flow over time.

Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich

Games Econ. Behav., 2015

Online Budgeted Repeated Matching.

Ajil Jalal, Rahul Vaze, Umang Bhaskar

CoRR, 2015

Near-Optimal Hardness Results for Signaling in Bayesian Games.

Umang Bhaskar, Yu Cheng, Young Kun Ko, Chaitanya Swamy

CoRR, 2015

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

Siddharth Barman, Umang Bhaskar, Chaitanya Swamy

CoRR, 2015

2014

Network improvement for equilibrium routing.

Umang Bhaskar, Katrina Ligett

SIGecom Exch., 2014

On the Existence of Low-Rank Explanations for Mixed Strategy Behavior.

Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Network Improvement for Equilibrium Routing.

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

The Network Improvement Problem for Equilibrium Routing.

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman

CoRR, 2013

The Complexity of Nash Equilibria as Revealed by Data.

Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman

CoRR, 2013

Online Mixed Packing and Covering.

Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The empirical implications of rank in Bimatrix games.

Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Online Mixed Packing and Covering

Umang Bhaskar, Lisa Fleischer

CoRR, 2012

2011

A competitive strategy for routing flow over time.

Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich

SIGecom Exch., 2011

2010

The Price of Collusion in Series-Parallel Networks.

Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Equilibria of atomic flow games are not unique.

Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009