Metraipolis › archive › dc_758fd1ecbd98

Learning Choice Model Trees for Feature-Based Multi-Product Pricing: Exact Optimization and Field Evidence — arXiv:2609.16952

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.16952
License (as archived)
CC0-1.0
Archived
2026-10-15T20:43:34.246Z
SHA-256 of the archived text
68351663810536b7c1ca50d9cf51dc6fafca11bb974e688ba779f00b4d9c1e38
Stable URL of this page
https://metraipolis.com/documento/dc_758fd1ecbd98

How to cite

Learning Choice Model Trees for Feature-Based Multi-Product Pricing: Exact Optimization and Field Evidence — arXiv:2609.16952 — arXiv (en), https://arxiv.org/abs/2609.16952 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_758fd1ecbd98 (Metraipolis archive dc_758fd1ecbd98, sha256 68351663810536b7c1ca50d9cf51dc6fafca11bb974e688ba779f00b4d9c1e38)
BibTeX
@misc{dc758fd1ecbd98,
  title = {Learning Choice Model Trees for Feature-Based Multi-Product Pricing: Exact Optimization and Field Evidence — arXiv:2609.16952},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.16952},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_758fd1ecbd98; sha256 68351663810536b7c1ca50d9cf51dc6fafca11bb974e688ba779f00b4d9c1e38},
  year = {2026}
}

Archived text

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

Feature-based multi-product pricing uses customer characteristics to identify demand heterogeneity and tailor prices across products. Choice model trees segment customers through interpretable feature rules and fit a demand model within each leaf. Existing methods typically construct these trees greedily, selecting one myopic split at a time. We develop optimal choice model trees with multinomial logit leaves (OCMT-MNL), jointly optimizing the tree and leaf models within a prescribed depth. Our exact dynamic program derives closed-form Fenchel lower bounds during constrained Newton iterations and propagates them across nested and disjoint customer subsets, avoiding new fits and resuming unfinished fits without repeating completed work. In synthetic experiments, it reduces exact leaf fits by 99.98% and leaf evaluations by 86.13%, achieving up to 7.15-fold speedups over unpruned dynamic programming. One-dimensional lookup tables translate offline estimation into real-time pricing, with a revenue-loss bound quadratic in grid spacing under the fitted model. Compared with greedy trees, OCMT-MNL achieves lower revenue loss with fewer leaves on synthetic data and better predictive fit on real data. In a 23-week randomized experiment on ancillary seat pricing across 48 airline markets and 190,220 passengers, OCMT-MNL increases seat revenue per passenger by a statistically significant 11.3% over static pricing.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-16 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.16952 — 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-15T19:36:35.850Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).