Metraipolis › archive › dc_6bcac05bb5de

Nonparametric Contextual Pricing and Inventory Learning under Censored Demand — arXiv:2608.30944

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30944
License (as archived)
CC0-1.0
Archived
2026-10-17T08:39:31.998Z
SHA-256 of the archived text
c3c7d5c52a7193156806b1f881f52f59e388f3501963ea39d2f17eefec46b5cf
Stable URL of this page
https://metraipolis.com/documento/dc_6bcac05bb5de

How to cite

Nonparametric Contextual Pricing and Inventory Learning under Censored Demand — arXiv:2608.30944 — arXiv (en), https://arxiv.org/abs/2608.30944 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6bcac05bb5de (Metraipolis archive dc_6bcac05bb5de, sha256 c3c7d5c52a7193156806b1f881f52f59e388f3501963ea39d2f17eefec46b5cf)
BibTeX
@misc{dc6bcac05bb5de,
  title = {Nonparametric Contextual Pricing and Inventory Learning under Censored Demand — arXiv:2608.30944},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30944},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6bcac05bb5de; sha256 c3c7d5c52a7193156806b1f881f52f59e388f3501963ea39d2f17eefec46b5cf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30944. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.30944 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T08:13:26.853Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).