AI RESEARCH
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
arXiv CS.AI
•
ArXi:2605.08290v1 Announce Type: cross We design the first regret guarantees for robust dynamic pricing that decouple the dependence on the corruption $C$ and the time horizon $T$. In dynamic pricing, a seller with unlimited supply of a good interacts with a stream of buyers over \( T \) rounds, with the goal of maximizing revenue. At each round $t$, the seller posts a price $p_t$, and the buyer purchases the good only if their unknown valuation $^\star$ exceeds this price.