Equilibria of atomic flow games are not unique. - Umang Bhaskar; Lisa Fleischer; Darrell Hoy; Chien-Chung Huang 001 (SODA, 2009)

The Price of Collusion in Series-Parallel Networks. - Umang Bhaskar; Lisa Fleischer; Chien-Chung Huang 001 (IPCO, 2010)

A competitive strategy for routing flow over time. - Umang Bhaskar; Lisa Fleischer; Elliot Anshelevich (SIGecom Exch., 2011)

Online Mixed Packing and Covering - Umang Bhaskar; Lisa Fleischer (CoRR, 2012)

The empirical implications of rank in Bimatrix games. - Siddharth Barman; Umang Bhaskar; Federico Echenique; Adam Wierman (EC, 2013)

Online Mixed Packing and Covering. - Yossi Azar; Umang Bhaskar; Lisa Fleischer; Debmalya Panigrahi (SODA, 2013)

The Complexity of Nash Equilibria as Revealed by Data. - Siddharth Barman; Umang Bhaskar; Federico Echenique; Adam Wierman (CoRR, 2013)

The Network Improvement Problem for Equilibrium Routing. - Umang Bhaskar; Katrina Ligett; Leonard J. Schulman (CoRR, 2013)

Network Improvement for Equilibrium Routing. - Umang Bhaskar; Katrina Ligett; Leonard J. Schulman (IPCO, 2014)

On the Existence of Low-Rank Explanations for Mixed Strategy Behavior. - Siddharth Barman; Umang Bhaskar; Federico Echenique; Adam Wierman (WINE, 2014)

Network improvement for equilibrium routing. - Umang Bhaskar; Katrina Ligett (SIGecom Exch., 2014)

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. - Siddharth Barman; Umang Bhaskar; Chaitanya Swamy (CoRR, 2015)

Near-Optimal Hardness Results for Signaling in Bayesian Games. - Umang Bhaskar; Yu Cheng 002; Young Kun-Ko; Chaitanya Swamy (CoRR, 2015)

Online Budgeted Repeated Matching. - Ajil Jalal; Rahul Vaze; Umang Bhaskar (CoRR, 2015)

A Stackelberg strategy for routing flow over time. - Umang Bhaskar; Lisa Fleischer; Elliot Anshelevich (Games Econ. Behav., 2015)

On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. - Umang Bhaskar; Lisa Fleischer; Darrell Hoy; Chien-Chung Huang 001 (Math. Oper. Res., 2015)

The Adwords Problem with Strict Capacity Constraints. - Umang Bhaskar; Ajil Jalal; Rahul Vaze (FSTTCS, 2016)

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. - Umang Bhaskar; Yu Cheng 002; Young Kun-Ko; Chaitanya Swamy (EC, 2016)

Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections. - Umang Bhaskar; Varsha Dani; Abheek Ghosh (AAAI, 2018)

Algorithms for Inverse Optimization Problems. - Sara Ahmadian; Umang Bhaskar; Laura Sanità; Chaitanya Swamy (ESA, 2018)

Equilibrium Computation in Atomic Splittable Routing Games. - Umang Bhaskar; Phani Raj Lolakapuri (ESA, 2018)

On the Welfare of Cardinal Voting Mechanisms. - Umang Bhaskar; Abheek Ghosh (FSTTCS, 2018)

Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions. - Umang Bhaskar; Phani Raj Lolakapuri (CoRR, 2018)

The Complexity of Partial Function Extension for Coverage Functions. - Umang Bhaskar; Gunjan Kumar (APPROX-RANDOM, 2019)

Computational Aspects of Equilibria in Discrete Preference Games. - Phani Raj Lolakapuri; Umang Bhaskar; Ramasuri Narayanam; Gyana R. Parija; Pankaj S. Dayama (IJCAI, 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)

A Non-Extendibility Certificate for Submodularity and Applications. - Umang Bhaskar; Gunjan Kumar (COCOON, 2020)

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. - Siddharth Barman; Umang Bhaskar; Anand Krishna; Ranjani G. Sundaram (ESA, 2020)

Partial Function Extension with Applications to Learning and Property Testing. - Umang Bhaskar; Gunjan Kumar (ISAAC, 2020)

Optimal Bounds on the Price of Fairness for Indivisible Goods. - Siddharth Barman; Umang Bhaskar; Nisarg Shah 001 (WINE, 2020)

Settling the Price of Fairness for Indivisible Goods. - Siddharth Barman; Umang Bhaskar; Nisarg Shah 001 (CoRR, 2020)

On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. - Umang Bhaskar; A. R. Sricharan; Rohit Vaish (APPROX-RANDOM, 2021)

The Price of Equity with Binary Valuations and Few Agent Types. - Umang Bhaskar; Neeldhara Misra; Aditi Sethia; Rohit Vaish (SAGT, 2023)

Nearly Equitable Allocations beyond Additivity and Monotonicity. - Siddharth Barman; Umang Bhaskar; Yeshwant Pandit; Soumyajit Pyne (AAAI, 2024)

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations. - Umang Bhaskar; Gunjan Kumar; Yeshwant Pandit; Rakshitha (CoRR, 2024)

EFX Allocations on Some Multi-graph Classes. - Umang Bhaskar; Yeshwant Pandit (CoRR, 2024)

Equilibrium Computation in the Hotelling-Downs Model of Spatial Competition. - Umang Bhaskar; Soumyajit Pyne (CoRR, 2024)

Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line. - Umang Bhaskar; Soumyajit Pyne (AAAI, 2025)

Maximizing Value in Challenge the Champ Tournaments. - Umang Bhaskar; Juhi Chaudhary; Palash Dey (AAMAS, 2025)

Towards Envy-Freeness Relaxations for General Nonmonotone Valuations. - Umang Bhaskar; Gunjan Kumar; Yeshwant Pandit; Rakshitha (AAMAS, 2025)

Connected equitable cake division via Sperner's lemma. - Umang Bhaskar; A. R. Sricharan; Rohit Vaish (Inf. Process. Lett., 2025)

Best of Both Worlds Guarantees for Equitable Allocations. - Umang Bhaskar; Vishwa Prakash HV; Aditi Sethia; Rakshitha (CoRR, 2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem. - Umang Bhaskar; Katharina Eickhoff; Lennart Kauther; Jannik Matuschke; Britta Peis; Laura Vargas Koch (CoRR, 2025)