Claims logarithmic and square-root regret bounds for dynamic pricing with inventory constraints across three information settings; key proof steps in the no-information and informed-price results are invalid as written.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices
Claims logarithmic and square-root regret bounds for dynamic pricing with inventory constraints across three information settings; key proof steps in the no-information and informed-price results are invalid as written.