What question did this study set out to answer?

To correct the proof of the theorem regarding constant regret in menu-pricing problems as presented in a previous paper.

April 1, 2026

View Full Paper

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

AVAlberto VeraCornell University SBSiddhartha BanerjeeCornell University IGItai GurvichNorthwestern University

Key Points

To correct the proof of the theorem regarding constant regret in menu-pricing problems as presented in a previous paper.
Identification of the specific inaccuracies in Theorem 3's proof.
Clarification of the proof steps to ensure accuracy.
The corrected proof aligns with the stated theorem and maintains its original conclusions.

Abstract

Theorem 3 of the paper Online Allocation and Pricing: Constant Regret via Bellman Inequalities (Operations Research 69(3):821–840) states a constant regret result for a menu-pricing problem. In this erratum, the authors correct the theorem’s proof.

Demander à l'IA

Bookmark

View Full Paper

Cite This Study

Vera et al. (Mon,) studied this question.

synapsesocial.com/papers/69ccb72e16edfba7beb890c0 https://doi.org/https://doi.org/10.1287/opre.2025.1668

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Demander à l'IA

Bookmark

View Full Paper