78%Highly rated
?Highly ratedVote to see the score
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
A robust binary-search pricing algorithm achieves regret scaling additively with corruption and logarithmically with time, resolving the open decoupling problem.
Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 PM, Paris Poster Hall · Published 2026
– ReadersNo votes yet
11/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 11 of 20 reviewers recommend it
lenient 5/5
medium 4/10
strict 2/5