Newest papers

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

Omar El Housni, Marouane Ibn Brahim · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.12917 · cited by 0 works (OpenAlex) · open-access PDF

German

Wir untersuchen die Einzelhandelssortimentplanung unter der AI-Mediation, wo ein Einzelhändler einen Katalog wählt, ein AI-Mittler eine kundenorientierte Shortlist bildet und der Kunde aus dieser Shortlist nach einem multinomialen Logit-Modell wählt. Wir berücksichtigen sowohl die deterministische Vermittlung, in der die AI einem festen segmentspezifischen Ranking folgt, als auch die stochastische Vermittlung basierend auf dem Plackett-Luce-Modell. Empirisch konstruieren wir einen Datensatz von Produktranglisten aus führenden AI-Modellen, schätzen die Plackett-Luce-Ranking-Modelle und bewerten ihre vorhersehbare Leistung auf gehaltenen Sortimenten. Wenn wir diese Schätzungen mit synthetischen Kundenpräferenzen kombinieren,

Machine translation (Meta M2M100); the English original follows.

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.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Ranking (information retrieval), Revenue, Multinomial logistic regression, Product (mathematics), Mediation, Econometrics

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange