8 citations · 11 across the 3 of their papers we have counts for
4 papers
Optimal Auctions via the Multiplicative Weight Method
Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala
We show that the multiplicative weight update method provides a simple recipe for designing and analyzing optimal Bayesian Incentive Compatible (BIC) auctions, and reduces the time…
Mechanism Design and Risk Aversion
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
We develop efficient algorithms to construct utility maximizing mechanisms in the presence of risk averse players (buyers and sellers) in Bayesian settings. We model risk aversion…
Social Welfare in One-sided Matching Markets without Money
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
We study social welfare in one-sided matching markets where the goal is to efficiently allocate n items to n agents that each have a complete, private preference list and a unit de…
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
Given a metric space on n points, an α-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of…