Anand Bhalgat

According to our database, Anand Bhalgat authored at least 17 papers between 2007 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2014

Partner tiering in display advertising.

Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni

Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

A Utility Equivalence Theorem for Concave Functions.

Anand Bhalgat, Sanjeev Khanna

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Optimal auctions via the multiplicative weight method.

Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Ad Allocation for Browse Sessions.

Anand Bhalgat, Sreenivas Gollapudi

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Mechanism Design for a Risk Averse Seller.

Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Mechanisms and allocations with positive network externalities.

Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Online allocation of display ads with smooth delivery.

Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011

Mechanism Design with Risk Aversion

Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna

CoRR, 2011

Improved Approximation Results for Stochastic Knapsack Problems.

Anand Bhalgat, Ashish Goel, Sanjeev Khanna

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Social Welfare in One-Sided Matching Markets without Money.

Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs.

Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP

Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna

CoRR, 2010

Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games.

Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

2009

Nash Dynamics in Congestion Games with Similar Resources.

Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Fast edge orientation for unweighted graphs.

Anand Bhalgat, Ramesh Hariharan

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

2008

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.

Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007