In:
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 32, No. 3 ( 2020-07), p. 835-853
Abstract:
We consider assortment optimization problems, where the choice process of a customer takes place in multiple stages. There is a finite number of stages. In each stage, we offer an assortment of products that does not overlap with the assortments offered in the earlier stages. If the customer makes a purchase within the offered assortment, then the customer leaves the system with the purchase. Otherwise, the customer proceeds to the next stage, where we offer another assortment. If the customer reaches the end of the last stage without a purchase, then the customer leaves the system without a purchase. The choice of the customer in each stage is governed by a multinomial logit model. The goal is to find an assortment to offer in each stage to maximize the expected revenue obtained from a customer. For this assortment optimization problem, it turns out that the union of the optimal assortments to offer in each stage is nested by revenue in the sense that this union includes a certain number of products with the largest revenues. However, it is still difficult to figure out the stage in which a certain product should be offered. In particular, the problem of finding an assortment to offer in each stage to maximize the expected revenue obtained from a customer is NP hard. We give a fully polynomial time approximation scheme for the problem when the number of stages is fixed.
Type of Medium:
Online Resource
ISSN:
1091-9856
,
1526-5528
DOI:
10.1287/ijoc.2019.0910
Language:
English
Publisher:
Institute for Operations Research and the Management Sciences (INFORMS)
Publication Date:
2020
detail.hit.zdb_id:
2070411-2
detail.hit.zdb_id:
2004082-9
SSG:
3,2
