4 citations · 6 across the 10 of their papers we have counts for
9 papers
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…
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…
Description Complexity of Regular Distributions
Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng +1
Myerson's regularity condition of a distribution is a standard assumption in economics. In this paper, we study the complexity of describing a regular distribution within a small s…
Robust Budget Pacing with a Single Sample
Santiago Balseiro, Rachitesh Kumar, Vahab Mirrokni +2
Major Internet advertising platforms offer budget pacing tools as a standard service for advertisers to manage their ad campaigns. Given the inherent non-stationarity in an adverti…
Pseudonorm Approachability and Applications to Regret Minimization
Christoph Dann, Yishay Mansour, Mehryar Mohri +2
Blackwell's celebrated approachability theory provides a general framework for a variety of learning problems, including regret minimization. However, Blackwell's proof and implici…
Tight Lower Bounds for Multiplicative Weights Algorithmic Families
Nick Gravin, Yuval Peres, Balasubramanian Sivan
We study the fundamental problem of prediction with expert advice and develop regret lower bounds for a large family of algorithms for this problem. We develop simple adversarial p…