Metraipolis › archive › dc_3b730dce01fe
Learning to Price and Stock Under Contextual and Censored Demand — arXiv:2609.06083
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06083
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:56:34.167Z
- SHA-256 of the archived text
b70b5fa6b27d3dfc1e9a806f8f2f8960138f74cf366b39510e440659debb0130- Stable URL of this page
https://metraipolis.com/documento/dc_3b730dce01fe
How to cite
Learning to Price and Stock Under Contextual and Censored Demand — arXiv:2609.06083 — arXiv (en), https://arxiv.org/abs/2609.06083 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3b730dce01fe (Metraipolis archive dc_3b730dce01fe, sha256 b70b5fa6b27d3dfc1e9a806f8f2f8960138f74cf366b39510e440659debb0130)
BibTeX
@misc{dc3b730dce01fe,
title = {Learning to Price and Stock Under Contextual and Censored Demand — arXiv:2609.06083},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06083},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3b730dce01fe; sha256 b70b5fa6b27d3dfc1e9a806f8f2f8960138f74cf366b39510e440659debb0130},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06083. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.06083 — 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-16T13:39:42.843Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).