Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anand Bhalgat
2010 – today
- 2013
[c13]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala: Optimal auctions via the multiplicative weight method. ACM Conference on Electronic Commerce 2013: 73-90- 2012
- [c12]Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni: Online allocation of display ads with smooth delivery. KDD 2012: 1213-1221
- [c11]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala: Mechanisms and allocations with positive network externalities. ACM Conference on Electronic Commerce 2012: 179-196
- [c10]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna: Mechanism Design for a Risk Averse Seller. WINE 2012: 198-211
- [c9]
- [i4]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala: Optimal Auctions via the Multiplicative Weight Method. CoRR abs/1211.1699 (2012)
- 2011
- [c8]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM 2011: 75-86
- [c7]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM 2011: 87-98
- [c6]Anand Bhalgat, Ashish Goel, Sanjeev Khanna: Improved Approximation Results for Stochastic Knapsack Problems. SODA 2011: 1647-1665
- [i3]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Social Welfare in One-sided Matching Markets without Money. CoRR abs/1104.2964 (2011)
- [i2]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna: Mechanism Design with Risk Aversion. CoRR abs/1107.4722 (2011)
- 2010
- [c5]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna: Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. ACM Conference on Electronic Commerce 2010: 73-82
- [i1]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP. CoRR abs/1011.3770 (2010)
2000 – 2009
- 2009
- [c4]
- [c3]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna: Nash Dynamics in Congestion Games with Similar Resources. WINE 2009: 362-373
- 2008
- [c2]Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464
- 2007
- [c1]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:44 CEST by the dblp team