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

Abstract

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 and adds a uniqueness requirement. The revision has implications also for the assortment problem in section 5.5 of the paper.

Publication
Operations Research