Derives the Pareto frontier for consistency C versus robustness R in randomized learning-augmented online bidding, with matching analytical bounds when R >= 2.885.
On tradeoffs in learning-augmented algorithms
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
-
The Pareto Frontier of Randomized Learning-Augmented Online Bidding
Derives the Pareto frontier for consistency C versus robustness R in randomized learning-augmented online bidding, with matching analytical bounds when R >= 2.885.