Strictly satisfying the return-on-spend constraint in online auto-bidding forces linear regret; a near-optimal algorithm exists only for constant values and threshold auctions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
Strictly satisfying the return-on-spend constraint in online auto-bidding forces linear regret; a near-optimal algorithm exists only for constant values and threshold auctions.