Erratum to Online Allocation and Pricing: Constant Regret via Bellman Inequalities

Published Online:https://doi.org/10.1287/opre.2025.1668

Theorem 3 of Vera et al. (2021) states a constant regret result for a menu-pricing problem. This erratum preserves theorem 3 but revises its proof. The revision has implications also for the assortment problem in section 5.5 of the paper.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.