Multipurchase Assortment Optimization Under a General Random Utility Model
成果类型:
Article; Early Access
署名作者:
Abdallah, Tarek; Braverman, Anton; Gu, Wenhao
署名单位:
Northwestern University
刊物名称:
OPERATIONS RESEARCH
ISSN/ISSBN:
0030-364X
DOI:
10.1287/opre.2025.1702
发表日期:
2026
关键词:
MULTINOMIAL LOGIT MODEL
revenue management
choice model
approximation
algorithm
demand
摘要:
The static assortment optimization problem, where customers select a single item according to some choice model such as a random utility model, is a classical and well-studied setting. In contrast, the multipurchase variant, where customers may choose multiple items, has received far less attention because modeling utility-maximizing behavior over sets of items is substantially more complex, even under natural extensions of the Multinomial Logit model. In this paper, we propose a general multipurchase choice model that extends the classical single-purchase framework without relying on specific distributional assumptions for the random utilities. We study the associated assortment optimization problem and address its computational intractability by introducing a tractable surrogate problem (SP). The SP arises naturally from an asymptotic regime where the number of items offered grows without bound. It can be solved efficiently, and its solutions perform remarkably well in numerical experiments compared with the true optimum. Beyond proving the asymptotic optimality of the SP solution, we derive nonasymptotic bounds that quantify its approximation error and provide explicit convergence rates. We further establish the identifiability of the surrogate choice model, provided there is sufficient variation in the offered assortments, and we also develop a maximum likelihood estimation procedure for the model parameters that remains valid, even when purchases of outside options are unobserved.