Nonparametric Contextual Pricing and Inventory Learning under Censored Demand

• URL: http://arxiv.org/abs/2608.30944v1
• Date: Mon, 31 Aug 2026 15:15:48 GMT
• Title: Nonparametric Contextual Pricing and Inventory Learning under Censored Demand
• Abstract summary: 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.
• Score: 5.6700444577605085
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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. However, the inventory level determines how much demand is revealed, and this information can influence subsequent decisions and future profits. 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. The challenge is to learn a context-dependent pricing and stocking policy without assuming a particular formula for demand or observing realized profit. To overcome this difficulty, 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, using data from past rounds with similar market conditions. This design allows us to learn while serving customers, without a separate exploration phase or the need to recover all demand hidden by stockouts. We prove the minimax optimality of the proposed algorithm, with strictly faster rates when expected profit varies more smoothly with price. Comprehensive numerical experiments have been conducted to confirm the effectiveness of the proposed algorithm.

Related papers

• Learning to Price and Stock Under Contextual and Censored Demand [5.326846590465264]
  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.
  arXiv  Detail & Related papers  (2026-09-05T13:21:46Z)
• Online Market Making and the Value of Observing the Order Book [44.5487486690729]
  We study an online market-making problem in which a learner sequentially posts bid and ask prices for a single asset.<n>We introduce an action-dependent feedback model inspired by real limit order books.<n>We show that this additional information fundamentally changes the learnability of the problem.
  arXiv  Detail & Related papers  (2026-05-19T09:26:01Z)
• On the Learning Curves of Revenue Maximization [62.087200798198786]
  A learning curve plots the decay of an algorithm's error for a fixed underlying distribution as a function of the number of training samples.<n>Prior work on revenue-maximizing learning algorithms adopts a distribution-free perspective, which parallels the PAC learning framework in learning theory.<n>We show that there exists a Bayes-consistent algorithm, meaning that its learning curve converges to zero for any arbitrary valuation distribution.
  arXiv  Detail & Related papers  (2026-04-29T17:38:25Z)
• What is the Value of Censored Data? An Exact Analysis for the Data-driven Newsvendor [1.5469452301122175]
  We study the setting where demand is censored at the inventory level and only sales are observed.<n>Our results show that policies based on this sales-as-demand data can suffer performance as sales data accumulates.
  arXiv  Detail & Related papers  (2026-02-18T20:13:02Z)
• 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)
• Offline Dynamic Inventory and Pricing Strategy: Addressing Censored and Dependent Demand [7.289672463326423]
  We study the offline sequential feature-based pricing and inventory control problem.<n>Our goal is to leverage the offline dataset to estimate the optimal pricing and inventory control policy.
  arXiv  Detail & Related papers  (2025-04-14T02:57:51Z)
• 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)
• An Instrumental Value for Data Production and its Application to Data Pricing [107.98697414652479]
  This paper develops an approach for capturing the instrumental value of data production processes.<n>We show how they connect to classic notions of information design and signals in information economics.
  arXiv  Detail & Related papers  (2024-12-24T03:53:57Z)
• 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)
• Online Learning for Equilibrium Pricing in Markets under Incomplete Information [8.145115843220308]
  We consider the problem of learning equilibrium prices over a horizon of $T$ periods in the incomplete information setting.<n>We develop algorithms that simultaneously achieve a regret of $O(1)$ when the customer demand is constant over time, and $O(sqrtT)$ when the demand varies over time.
  arXiv  Detail & Related papers  (2023-03-21T00:53:37Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Greedy Algorithm almost Dominates in Smoothed Contextual Bandits [100.09904315064372]
  Online learning algorithms must balance exploration and exploitation. We show that a greedy approach almost matches the best possible Bayesian regret rate of any other algorithm.
  arXiv  Detail & Related papers  (2020-05-19T18:11:40Z)

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.