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.
Competitive caching with machine learned advice
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.