Learning to Price and Stock Under Contextual and Censored Demand

• URL: http://arxiv.org/abs/2609.06083v1
• Date: Sat, 05 Sep 2026 13:21:46 GMT
• Title: Learning to Price and Stock Under Contextual and Censored Demand
• Abstract summary: We present a framework where we model demand as a linear combination of basis functions with unknown coefficients.<n>We propose an efficient algorithm to achieve regret bound $mathcalO(KsqrtTlog T)$ under concave revenue conditions and $mathcalO(K2/3T2/3(log T)1/2)$ for the general case.
• Score: 5.326846590465264
• License: http://creativecommons.org/licenses/by/4.0/
• 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 $\mathcal{O}(K\sqrt{T}\log T)$ under concave revenue conditions and $\mathcal{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.

Related papers

• Nonparametric Contextual Pricing and Inventory Learning under Censored Demand [5.6700444577605085]
  In online retailing, when a product sells out, a retailer often sees only the units sold, not how many customers would have bought it had inventory been available.<n>We study an online selling problem in which, in each round, the seller observes a market context and then makes pricing and stocking decisions based on censored sales data from previous rounds.<n>We propose a Mean-Calibrated Kernel UCB (MCK-UCB) algorithm that turns each incomplete sales record into a reliable guide for both inventory and price decisions.
  arXiv  Detail & Related papers  (2026-08-31T15:15:48Z)
• Thinking Hard, Not Smart: Reasoning Models Fail to Ration Test-Time Compute Across Questions [59.21329728895449]
  We introduce an exam-style evaluation framework for studying this setting.<n>We find that models fail to allocate a shared budget strategically across questions of varying difficulties and values.<n>These findings establish global budget allocation as a distinct capability that is not captured by conventional per-question evaluation.
  arXiv  Detail & Related papers  (2026-08-08T07:04:28Z)
• e1: Learning Adaptive Control of Reasoning Effort [88.51897900019485]
  Increasing the thinking budget of AI models can significantly improve accuracy, but not all questions warrant the same amount of reasoning.<n>Users may prefer to allocate different amounts of reasoning effort depending on how they value output quality versus latency and cost.<n>We propose Adaptive Effort Control, a self-adaptive reinforcement learning method that trains models to use a user-specified fraction of tokens.
  arXiv  Detail & Related papers  (2025-10-30T23:12:21Z)
• Bayesian Optimization for Dynamic Pricing and Learning [0.306238659426286]
  Dynamic pricing is the practice of adjusting the selling price of a product to maximize a firm's revenue by responding to market demand.<n>Traditional approaches often assume a specific parametric form for the demand function, enabling the use of reinforcement learning (RL) to identify near-optimal pricing strategies.<n>We propose a nonparametric approach to dynamic pricing that avoids restrictive modeling assumptions.
  arXiv  Detail & Related papers  (2025-10-14T12:28:06Z)
• Dynamic Pricing with Adversarially-Censored Demands [25.566323930646178]
  We study an online dynamic pricing problem where the potential demand at each time period $t=1,2,ldots, T$ is and dependent on the price.<n>A perishable inventory is imposed at the beginning of each time $t$, censoring the potential demand if it exceeds the inventory level.<n>We show that our algorithm achieves $tildeO(sqrtT)$ optimal regret even with adversarial inventory series.
  arXiv  Detail & Related papers  (2025-02-10T05:37:39Z)
• Deep Generative Demand Learning for Newsvendor and Pricing [7.594251468240168]
  We consider data-driven inventory and pricing decisions in the feature-based newsvendor problem. We propose a novel approach leveraging conditional deep generative models (cDGMs) to address these challenges. We provide theoretical guarantees for our approach, including the consistency of profit estimation and convergence of our decisions to the optimal solution.
  arXiv  Detail & Related papers  (2024-11-13T14:17:26Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Pricing with Contextual Elasticity and Heteroscedastic Valuation [23.96777734246062]
  We study an online contextual dynamic pricing problem, where customers decide whether to purchase a product based on its features and price. We introduce a novel approach to modeling a customer's expected demand by incorporating feature-based price elasticity. Our results shed light on the relationship between contextual elasticity and heteroscedastic valuation, providing insights for effective and practical pricing strategies.
  arXiv  Detail & Related papers  (2023-12-26T11:07:37Z)
• Online Learning under Budget and ROI Constraints via Weak Adaptivity [57.097119428915796]
  Existing primal-dual algorithms for constrained online learning problems rely on two fundamental assumptions. We show how such assumptions can be circumvented by endowing standard primal-dual templates with weakly adaptive regret minimizers. We prove the first best-of-both-worlds no-regret guarantees which hold in absence of the two aforementioned assumptions.
  arXiv  Detail & Related papers  (2023-02-02T16:30:33Z)
• Autoregressive Bandits [58.46584210388307]
  We propose a novel online learning setting, Autoregressive Bandits, in which the observed reward is governed by an autoregressive process of order $k$. We show that, under mild assumptions on the reward process, the optimal policy can be conveniently computed. We then devise a new optimistic regret minimization algorithm, namely, AutoRegressive Upper Confidence Bound (AR-UCB), that suffers sublinear regret of order $widetildemathcalO left( frac(k+1)3/2sqrtnT (1-G
  arXiv  Detail & Related papers  (2022-12-12T21:37:36Z)
• Navigating to the Best Policy in Markov Decision Processes [68.8204255655161]
  We investigate the active pure exploration problem in Markov Decision Processes. Agent sequentially selects actions and, from the resulting system trajectory, aims at the best as fast as possible.
  arXiv  Detail & Related papers  (2021-06-05T09:16:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.