A Pareto-optimal randomized learning-augmented algorithm for online bidding is obtained by reducing any algorithm to a bidding profile whose optimal form is characterized by a system of delayed differential equations.
Prophet and secretary at the same time
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Private unreliable signals in single-buyer pricing yield strictly better consistency-robustness Pareto frontiers than public signals, with mechanisms achieving perfect consistency and at least 1/2 robustness for any prior.
citing papers explorer
-
Optimal Learning-Augmented Algorithm for Online Bidding
A Pareto-optimal randomized learning-augmented algorithm for online bidding is obtained by reducing any algorithm to a bidding profile whose optimal form is characterized by a system of delayed differential equations.
-
Optimal Pricing with Unreliable Signals
Private unreliable signals in single-buyer pricing yield strictly better consistency-robustness Pareto frontiers than public signals, with mechanisms achieving perfect consistency and at least 1/2 robustness for any prior.