Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence
Jason Gaitonde, Yingkai Li, Bar Light +2
We study the aggregate welfare and individual regret guarantees of dynamic \emph{pacing algorithms} in the context of repeated auctions with budgets. Such algorithms are commonly u…
cs.GT2025
Equilibria in Repeated Games under No-Regret with Dynamic Benchmarks
Ludovico Crippa, Yonatan Gur, Bar Light
In repeated games, strategies are often evaluated by their ability to guarantee the performance of the single best action that is selected in hindsight, a property referred to as \…