Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 47 min ago
PreprintarXiv licencearXiv

AI-Mediation in Retail Markets: Revenue Effects and Assortment Optimization

Abstract

AI shopping assistants increasingly influence which products consumers consider. We study retail assortment planning under AI mediation, where a retailer chooses a catalog, an AI intermediary forms a customer-facing shortlist, and the customer chooses from that shortlist according to a multinomial logit model. We consider both deterministic mediation, in which the AI follows a fixed segment-specific ranking, and stochastic mediation based on the Plackett-Luce model. Empirically, we construct a dataset of product rankings from leading AI models, estimate Plackett-Luce ranking models, and evaluate their predictive performance on held-out assortments. Combining these estimates with synthetic customer preferences, we find that accounting for AI mediation can materially change optimal assortments and revenue. Across the tested capacity configurations, ignoring mediation yields mean revenue losses between 2.52% and 11.37% relative to the PL optimum. A much simpler deterministic plug-in, based only on the ordering of fitted AI utilities, performs substantially better, with mean losses of at most 0.53%. Motivated by this performance, we study assortment optimization under deterministic mediation. We characterize its computational complexity and show that, for any fixed number of customer segments, the problem admits a fully polynomial-time approximation scheme.

Related

  1. A Unified Framework for Assortment Optimization and Matching under MNL Choice
    Omar El Housni, Ulysse Hennebelle
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Assortment optimization under the perception-adjusted Luce model
    Gerardo Berbeglia, Mashbat Suzuki, Matthew Tam
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. The Value of Experiments in Assortment Optimization
    Mohammadreza Ahmadnejadsaein, Amine Bennouna, Omar El Housni
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Inventory and Assortment Optimization under General Choice: A Unified Approximation Framework
    Jacob Feldman, Heng Zhang, Yukai Huang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification
    Joongkyu Lee, Min-hwan Oh
    arXivPreprintCC BY-SA 4.0Full textStatisticsarXiv
BibTeX
@misc{housni2026aimediation,
  title = {{AI-Mediation in Retail Markets: Revenue Effects and Assortment Optimization}},
  author = {Omar El Housni and Marouane Ibn Brahim},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.12917},
  eprint = {2610.12917},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.12917},
}
RIS
TY  - UNPB
TI  - AI-Mediation in Retail Markets: Revenue Effects and Assortment Optimization
AU  - Omar El Housni
AU  - Marouane Ibn Brahim
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.12917
UR  - https://arxiv.org/abs/2610.12917
AB  - AI shopping assistants increasingly influence which products consumers consider. We study retail assortment planning under AI mediation, where a retailer chooses a catalog, an AI intermediary forms a customer-facing shortlist, and the customer chooses from that shortlist according to a multinomial logit model. We consider both deterministic mediation, in which the AI follows a fixed segment-specific ranking, and stochastic mediation based on the Plackett-Luce model. Empirically, we construct a dataset of product rankings from leading AI models, estimate Plackett-Luce ranking models, and evaluate their predictive performance on held-out assortments. Combining these estimates with synthetic customer preferences, we find that accounting for AI mediation can materially change optimal assortments and revenue. Across the tested capacity configurations, ignoring mediation yields mean revenue losses between 2.52% and 11.37% relative to the PL optimum. A much simpler deterministic plug-in, based only on the ordering of fitted AI utilities, performs substantially better, with mean losses of at most 0.53%. Motivated by this performance, we study assortment optimization under deterministic mediation. We characterize its computational complexity and show that, for any fixed number of customer segments, the problem admits a fully polynomial-time approximation scheme.
ER  -