Metraipolis › archive › dc_e1c5bc07928a

The Value of Experiments in Assortment Optimization — arXiv:2610.40557

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40557
License (as archived)
CC0-1.0
Archived
2026-11-01T02:32:20.297Z
SHA-256 of the archived text
3f169478744d2e4b2ec810ee7ca1cac521ac26653534d88a1dd1ddf5774f3adb
Stable URL of this page
https://metraipolis.com/documento/dc_e1c5bc07928a

How to cite

The Value of Experiments in Assortment Optimization — arXiv:2610.40557 — arXiv (en), https://arxiv.org/abs/2610.40557 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e1c5bc07928a (Metraipolis archive dc_e1c5bc07928a, sha256 3f169478744d2e4b2ec810ee7ca1cac521ac26653534d88a1dd1ddf5774f3adb)
BibTeX
@misc{dce1c5bc07928a,
  title = {The Value of Experiments in Assortment Optimization — arXiv:2610.40557},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40557},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e1c5bc07928a; sha256 3f169478744d2e4b2ec810ee7ca1cac521ac26653534d88a1dd1ddf5774f3adb},
  year = {2026}
}

Archived text

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

Retailers can learn customer preferences by experimenting with different assortments. However, the cost of each experiment and the operational burden of repeatedly changing product offerings can make extensive experimentation impractical. We study how much a retailer can improve its final assortment decision using customer observations from one (or a very small number of) fixed experimental assortments. We consider the multinomial logit model, where product revenues are known but customer preferences are unknown. In this setting, we jointly design the experimental assortment and the rule for selecting a final assortment from observed customer choices to minimize worst-case regret: the expected revenue loss of the final assortment relative to an optimal assortment under the true preferences, maximized over possible customer preferences. We first characterize exactly the minimax regret and an optimal assortment when no experimentation is possible. We then show, surprisingly, that offering a single experimental assortment to just one customer can already substantially reduce regret, depending on how the products' revenues compare. We derive the exact minimax regret and an optimal experimental policy in this setting. When a single fixed experimental assortment is offered to many customers, we give a geometric characterization of the limiting minimax regret and construct an asymptotically optimal policy. Depending on product revenues, this single experiment can yield no improvement over no experimentation or nearly complete regret reduction. Finally, we extend our analysis to multiple experimental assortments chosen in advance, characterizing the limiting minimax regret, constructing asymptotically optimal policies, and identifying which collections of assortments allow worst-case regret to vanish as the number of customer observations grows.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.40557 — 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-11-01T02:14:28.333Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).