default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUmang Bhaskar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne:
Nearly Equitable Allocations beyond Additivity and Monotonicity. AAAI 2024: 9494-9501- [i19]Umang Bhaskar, Soumyajit Pyne:
Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line. CoRR abs/2405.04696 (2024) - 2023
- [c22]Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish:
The Price of Equity with Binary Valuations and Few Agent Types. SAGT 2023: 271-289 - [i18]Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish:
The Price of Equity with Binary Valuations and Few Agent Types. CoRR abs/2307.06726 (2023) - [i17]Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne:
Nearly Equitable Allocations Beyond Additivity and Monotonicity. CoRR abs/2312.07195 (2023) - 2021
- [c21]Umang Bhaskar, A. R. Sricharan, Rohit Vaish:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. APPROX-RANDOM 2021: 1:1-1:23 - 2020
- [c20]Umang Bhaskar, Gunjan Kumar:
A Non-Extendibility Certificate for Submodularity and Applications. COCOON 2020: 603-614 - [c19]Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram:
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. ESA 2020: 11:1-11:17 - [c18]Umang Bhaskar, Gunjan Kumar:
Partial Function Extension with Applications to Learning and Property Testing. ISAAC 2020: 46:1-46:16 - [c17]Siddharth Barman, Umang Bhaskar, Nisarg Shah:
Optimal Bounds on the Price of Fairness for Indivisible Goods. WINE 2020: 356-369 - [i16]Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram:
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. CoRR abs/2005.07370 (2020) - [i15]Siddharth Barman, Umang Bhaskar, Nisarg Shah:
Settling the Price of Fairness for Indivisible Goods. CoRR abs/2007.06242 (2020) - [i14]Umang Bhaskar, A. R. Sricharan, Rohit Vaish:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. CoRR abs/2012.06788 (2020)
2010 – 2019
- 2019
- [j5]Umang Bhaskar, Katrina Ligett
, Leonard J. Schulman, Chaitanya Swamy:
Achieving target equilibria in network routing games without knowing the latency functions. Games Econ. Behav. 118: 533-569 (2019) - [c16]Umang Bhaskar, Gunjan Kumar:
The Complexity of Partial Function Extension for Coverage Functions. APPROX-RANDOM 2019: 30:1-30:21 - [c15]Phani Raj Lolakapuri, Umang Bhaskar, Ramasuri Narayanam, Gyana R. Parija, Pankaj S. Dayama:
Computational Aspects of Equilibria in Discrete Preference Games. IJCAI 2019: 471-477 - [i13]Phani Raj Lolakapuri, Umang Bhaskar, Ramasuri Narayanam, Gyana R. Parija, Pankaj S. Dayama:
Computational Aspects of Equilibria in Discrete Preference Games. CoRR abs/1905.11680 (2019) - [i12]Umang Bhaskar, Gunjan Kumar:
The Complexity of Partial Function Extension for Coverage Functions. CoRR abs/1907.07230 (2019) - 2018
- [c14]Umang Bhaskar, Varsha Dani, Abheek Ghosh:
Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections. AAAI 2018: 925-932 - [c13]Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. ESA 2018: 1:1-1:14 - [c12]Umang Bhaskar, Phani Raj Lolakapuri:
Equilibrium Computation in Atomic Splittable Routing Games. ESA 2018: 58:1-58:14 - [c11]Umang Bhaskar, Abheek Ghosh:
On the Welfare of Cardinal Voting Mechanisms. FSTTCS 2018: 27:1-27:22 - [i11]Umang Bhaskar, Phani Raj Lolakapuri:
Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions. CoRR abs/1804.10044 (2018) - [i10]Umang Bhaskar, Gunjan Kumar:
Partial Function Extension with Applications to Learning and Property Testing. CoRR abs/1812.05821 (2018) - 2016
- [c10]Umang Bhaskar, Ajil Jalal, Rahul Vaze:
The Adwords Problem with Strict Capacity Constraints. FSTTCS 2016: 30:1-30:14 - [c9]Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy:
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. EC 2016: 479-496 - 2015
- [j4]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg strategy for routing flow over time. Games Econ. Behav. 92: 232-247 (2015) - [j3]Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang:
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Math. Oper. Res. 40(3): 634-654 (2015) - [i9]Siddharth Barman, Umang Bhaskar, Chaitanya Swamy:
Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. CoRR abs/1505.04897 (2015) - [i8]Ajil Jalal, Rahul Vaze, Umang Bhaskar:
Online Budgeted Repeated Matching. CoRR abs/1512.00153 (2015) - [i7]Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy:
Near-Optimal Hardness Results for Signaling in Bayesian Games. CoRR abs/1512.03543 (2015) - 2014
- [j2]Umang Bhaskar, Katrina Ligett:
Network improvement for equilibrium routing. SIGecom Exch. 13(2): 36-40 (2014) - [c8]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy:
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. FOCS 2014: 31-40 - [c7]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman:
Network Improvement for Equilibrium Routing. IPCO 2014: 138-149 - [c6]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
On the Existence of Low-Rank Explanations for Mixed Strategy Behavior. WINE 2014: 447-452 - [i6]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy:
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. CoRR abs/1408.1429 (2014) - 2013
- [c5]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
The empirical implications of rank in Bimatrix games. EC 2013: 55-72 - [c4]Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi:
Online Mixed Packing and Covering. SODA 2013: 85-100 - [i5]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
The Empirical Implications of Rank in Bimatrix Games. CoRR abs/1305.3336 (2013) - [i4]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman:
The Network Improvement Problem for Equilibrium Routing. CoRR abs/1307.3794 (2013) - [i3]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
The Complexity of Nash Equilibria as Revealed by Data. CoRR abs/1311.2655 (2013) - 2012
- [i2]Umang Bhaskar, Lisa Fleischer:
Online Mixed Packing and Covering. CoRR abs/1203.6695 (2012) - 2011
- [j1]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A competitive strategy for routing flow over time. SIGecom Exch. 10(2): 23-28 (2011) - [c3]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time. SODA 2011: 192-201 - 2010
- [c2]Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang:
The Price of Collusion in Series-Parallel Networks. IPCO 2010: 313-326 - [i1]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time. CoRR abs/1010.3034 (2010)
2000 – 2009
- 2009
- [c1]Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang:
Equilibria of atomic flow games are not unique. SODA 2009: 748-757
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
