Skip to content
#machine learning Conference Open access

Learning to Price and Stock Under Contextual and Censored Demand

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · 1 citation · 42 references
Computer Science

TL;DR

This work proposes an efficient algorithm to achieve regret bound O(K sqrt(T) log T) under concave revenue conditions and O(K^(2/3) T^(2/3) (log T)^(1/2) for the general case, with matching lower bounds confirming optimality.

Abstract

To make optimal joint pricing and inventory control decisions is a critical challenge for modern retailers. In practice, retailers face changing market conditions where demands are influenced by various contextual factors, while simultaneously dealing with the difficulty of lost sales that obscure true demand information. However, existing approaches often fail to account for both contextual information and censored demand observations. We address this gap by presenting a framework where we model demand as a linear combination of basis functions with unknown coefficients, allowing for adaptive pricing and inventory decisions that respond to changing contexts. We propose an efficient algorithm to achieve regret bound O(K sqrt(T) log T) under concave revenue conditions and O(K^(2/3) T^(2/3) (log T)^(1/2)) for the general case, with matching lower bounds confirming optimality. Extensive numerical experiments across diverse scenarios demonstrate our algorithm’s effectiveness.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

Optimal Nonparametric Dynamic Pricing with Censored Demand and Adversarial Inventory

Threshold-UCB is developed, which improves the expected regret to $\widetilde{\mathcal{O}}(T^{2/3})$ and reuses sales observations across inventory levels through shared estimates of demand-tail probabilities, allowing the same data to support revenue upper bounds for multiple inventories rather than a single inventory...

Meng-Xiao Zhang, Ying-Fei Wang, Hai-Peng Luo · 0 citations
Sep 2026

Managing Inventory and Pricing with Contextual Robust Optimization

Multiproduct inventory and pricing problems are traditionally approached by estimating a presumed sufficiently accurate demand model and then optimizing with this specified model to determine optimal inventory and pricing decisions. However, obtaining an accurate demand model is nearly impossible because of unobservabl...

Xun Zhang, Qin-Shen Tang, Zhi Chen et al. · 1 citation
Open access Aug 2026

Dynamic Learning for Joint Pricing, Advertising, and Inventory Management

Problem definition: Startup firms, often small in size, face the challenge of making cross-functional decisions due to the absence of distinct departments like marketing and operations. These interdependent decisions are further complicated by the lack of historical customer data. As a result, these firms must learn ab...

Huseyin Gurkan, N. Keskin, R. Parker · 0 citations
Preprint Sep 2026

Information Limits of Multistage Inventory Control: Learning, Valuation, and Censoring

Learning how to replenish inventory and estimating the cost of doing so require different information. We establish information-theoretic lower bounds for offline multistage inventory control with independent bounded demand. For fixed additive error in total expected cost, policy learning requires cubically many scalar...

Han-Zhang Qin, D. Simchi-Levi, Rui-Hao Zhu · 0 citations
Open access Sep 2026

EXPRESS: Learning to Price under Competition with Reference Price Effects

This paper studies the algorithmic design of price competition in oligopolistic markets, with a focus on long-run market dynamics under reference price effects. We consider a sequential price competition framework with multiple sellers operating over a finite horizon, each lacking prior knowledge of the demand functi...

Yong-Ge Yang, Jian-Nan Ke, Cong Shi · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.