4 citations · 33 across the 44 of their papers we have counts for
4 papers · 1 filter
Strategizing against No-regret Learners
Yuan Deng, Jon Schneider, Balusubramanian Sivan
How should a player who repeatedly plays a game against a no-regret learner strategize to maximize his utility? We study this question and show that under some mild assumptions, th…
Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction
Will Ma, Balasubramanian Sivan
What fraction of the single item buyers setting's expected optimal revenue MyeRev can the second price auction with reserves achieve? In the special case where the buyers' valu…
Dynamic First Price Auctions Robust to Heterogeneous Buyers
Shipra Agrawal, Eric Balkanski, Vahab Mirrokni +1
We study dynamic mechanisms for optimizing revenue in repeated auctions, that are robust to heterogeneous forward-looking and learning behavior of the buyers. Typically it is assum…
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan +1
We present prior robust algorithms for a large class of resource allocation problems where requests arrive one-by-one (online), drawn independently from an unknown distribution at…