activity
20092026
most citedStability of Service under Time-of-Use Pricing

4 citations · 33 across the 44 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

cs.DC2024

Distributed Load Balancing with Workload-Dependent Service Rates

Wenxin Zhang, Santiago R. Balseiro, Robert Kleinberg +3

Modern service systems, including cloud platforms and large language model inference endpoints, must distribute jobs across servers whose processing speeds depend on current worklo…

cs.GT2024★ 1 cited

Auto-bidding and Auctions in Online Advertising: A Survey

Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro +23

In this survey, we summarize recent developments in research fueled by the growing adoption of automated bidding strategies in online advertising. We explore the challenges and opp…

stat.ML2024

Rate-Preserving Reductions for Blackwell Approachability

Christoph Dann, Yishay Mansour, Mehryar Mohri +2

Abernethy et al. (2011) showed that Blackwell approachability and no-regret learning are equivalent, in the sense that any algorithm that solves a specific Blackwell approachabilit…

cs.GT2024★ 1 cited

Revenue Variance Minimization: Beyond First Price Auctions

Marek Bojko, Preston McAfee, Renato Paes Leme +2

We study revenue variance in the sale of homogeneous items to risk-neutral, unit-demand bidders with independent private values. Although the Revenue Equivalence Theorem implie…

cs.GT2024

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions

Rachitesh Kumar, Jon Schneider, Balasubramanian Sivan

Learning to bid in repeated first-price auctions is a fundamental problem at the interface of game theory and machine learning, which has seen a recent surge in interest due to the…