IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v57y2025i1p16-29.html
   My bibliography  Save this article

Ranking and pricing under a cascade model of consumer review browsing

Author

Listed:
  • Jingtong Zhao
  • Xin Pan
  • Van-Anh Truong
  • Jie Song

Abstract

In online platforms, the reviews posted by existing consumers are playing an increasingly important role in the purchasing decisions of potential consumers. Motivated by this observation, we study the problems faced by a platform selling a single product with no capacity constraint, where the demand is explicitly influenced by the reviews presented to the consumers. More precisely, we model a consumer’s browsing of reviews for a single product as following a cascade click model, with each consumer seeing some initial number of reviews and forming a utility estimate for the product based on the reviews the consumer has read. In the first part of the paper, we consider how to rank the reviews to induce short- and long-term revenue-maximizing purchasing behaviors. In the second part, we study how to set the price of the product. We derive structural insights and bounds on both problems. We also consider the case that the parameters of the model are unknown, where we propose algorithms that learn the parameters and optimize the ranking of the reviews or the price online. We show that our algorithms have regrets O(T23).

Suggested Citation

  • Jingtong Zhao & Xin Pan & Van-Anh Truong & Jie Song, 2025. "Ranking and pricing under a cascade model of consumer review browsing," IISE Transactions, Taylor & Francis Journals, vol. 57(1), pages 16-29, January.
    • Handle: RePEc:taf:uiiexx:v:57:y:2025:i:1:p:16-29
    DOI: 10.1080/24725854.2023.2274898
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2274898
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2023.2274898?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:57:y:2025:i:1:p:16-29. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.