Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Umang Bhaskar
Observed name:
Bhaskar, Umang
Institution:
Tata Institute of Fundamental Research
Observed institutions:
Dartmouth College,
Tata Institute of Fundamental Research,
California Institute of Technology,
University of Waterloo
ORCID:
0009-0006-7939-7961
Observed ORCID:
0009-0006-7939-7961
OpenAlex ID:
A5003054080
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
2020
·
Bhaskar, Umang
, Sricharan, A. R.
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
117
PDF
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games
2016
·
Umang Bhaskar
, Yu Cheng
, et al.
·
ACM Conference on Economics and Computation (EC)
·
105
PDF
Optimal Bounds on the Price of Fairness for Indivisible Goods
2020
·
Siddharth Barman
, Umang Bhaskar
, et al.
·
Lecture notes in computer science
·
74
PDF
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations
2020
·
Barman, Siddharth
, Bhaskar, Umang
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
62
PDF
Online Mixed Packing and Covering
2013
·
Yossi Azar
, Umang Bhaskar
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
59
A Stackelberg strategy for routing flow over time
2013
·
Umang Bhaskar
, Lisa Fleischer
, et al.
·
Games and Economic Behavior
·
56
PDF
Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections
2018
·
Umang Bhaskar
, Varsha Dani
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
50
PDF
Equilibria of atomic flow games are not unique
2009
·
Umang Bhaskar
, Lisa Fleischer
, et al.
·
Max Planck Institute for Plasma Physics
·
36
Equilibria of Atomic Flow Games are not Unique
2009
·
Umang Bhaskar
, Lisa Fleischer
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
27
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions
2014
·
Umang Bhaskar
, Katrina Ligett
, et al.
·
Annual Symposium on Foundations of Computer Science
·
24
Achieving target equilibria in network routing games without knowing the latency functions
2018
·
Umang Bhaskar
, Katrina Ligett
, et al.
·
Games and Economic Behavior
·
21
PDF
The Price of Collusion in Series-Parallel Networks
2010
·
Umang Bhaskar
, Lisa Fleischer
, et al.
·
Lecture notes in computer science
·
18
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
2014
·
Umang Bhaskar
, Lisa Fleischer
, et al.
·
Mathematics of Operations Research
·
17
A Stackelberg Strategy for Routing Flow over Time
2011
·
Umang Bhaskar
, Lisa Fleischer
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
15
EFX Allocations on Some Multi-graph Classes
2024
·
Bhaskar, Umang
, Pandit, Yeshwant
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
11
PDF
Nearly Equitable Allocations beyond Additivity and Monotonicity
2024
·
Siddharth Barman
, Umang Bhaskar
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
11
PDF
The Price of Equity with Binary Valuations and Few Agent Types
2023
·
Umang Bhaskar
, Neeldhara Misra
, et al.
·
Lecture notes in computer science
·
10
PDF
Algorithms for Inverse Optimization Problems
2018
·
Ahmadian, Sara
, Bhaskar, Umang
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
10
PDF
Equilibrium Computation in Atomic Splittable Routing Games
2018
·
Bhaskar, Umang
, Lolakapuri, Phani Raj
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Network Improvement for Equilibrium Routing
2014
·
Umang Bhaskar
, Katrina Ligett
, et al.
·
Lecture notes in computer science
·
8
The empirical implications of rank in Bimatrix games
2013
·
Siddharth Barman
, Umang Bhaskar
, et al.
·
ACM Conference on Electronic Commerce (EC)
·
7
The Network Improvement Problem for Equilibrium Routing
2013
·
Bhaskar, Umang
, Ligett, Katrina
, et al.
·
arXiv (Cornell University)
·
6
PDF
Computational Aspects of Equilibria in Discrete Preference Games
2019
·
Phani Raj Lolakapuri
, Umang Bhaskar
, et al.
·
International Joint Conference on Artificial Intelligence
·
5
PDF
The Complexity of Partial Function Extension for Coverage Functions
2019
·
Bhaskar, Umang
, Kumar, Gunjan
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
Partial Function Extension with Applications to Learning and Property Testing
2018
·
Bhaskar, Umang
, Kumar, Gunjan
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
Show more works
View as search
Works count:
55
Citation count:
801
H-index:
14
I10-index:
18
Year
Topic
Type