IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v70y2022i4p2162-2184.html
   My bibliography  Save this article

Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays

Author

Listed:
  • Jacob Feldman

    (Olin Business School, Washington University, St. Louis, Missouri 63130)

  • Danny Segev

    (Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel)

Abstract

In this paper, we consider the assortment problem under the multinomial logit (MNL) model with sequential offerings recently proposed by Liu et al. [INFORMS J. Comput., 2020 ] to capture a multitude of applications, ranging from appointment scheduling in hospitals, restaurants, and fitness centers to product recommendations in e-commerce settings. In this problem, the purchasing dynamics of customers sequentially unfold over T stages. Within each stage, the retailer selects an assortment of products to make available for purchase with the intent of maximizing expected revenue. However, motivated by practical applications, the caveat is that each product can be offered in at most one stage. Moving from one stage to the next, the customer either purchases one of the currently offered products according to MNL preferences and leaves the system or decides not to make any purchase at that time. In the former scenario, the retailer gains a product-associated revenue; in the latter scenario, the customer progresses to the next stage or eventually leaves the system once all T stages have been traversed. We focus our attention on the most general formulation of this problem, in which purchasing decisions are governed by a stage-dependent MNL choice model, reflecting the notion that customers’ preferences may change from stage to stage because of updated perceptions, patience waning over time, etc. Concurrently, we consider a more structured formulation in which purchasing decisions are stage-invariant, utilizing a single MNL model across all stages. Our main contribution comes in the form of a strongly polynomial-time approximation scheme for both formulations of the sequential assortment problem in their utmost generality. We provide evidence for the practical relevance of these theoretical findings through extensive numerical experiments. Finally, we fit our sequential model to historical search data from Expedia’s hotel booking platform. We observe substantial gains in fitting accuracy when our model is benchmarked against other well-known choice models designed for the setting at hand.

Suggested Citation

  • Jacob Feldman & Danny Segev, 2022. "Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays," Operations Research, INFORMS, vol. 70(4), pages 2162-2184, July.
  • Handle: RePEc:inm:oropre:v:70:y:2022:i:4:p:2162-2184
    DOI: 10.1287/opre.2021.2218
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2021.2218
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2021.2218?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:70:y:2022:i:4:p:2162-2184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.