IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v70y2024i2p1029-1051.html
   My bibliography  Save this article

How Does Competition Affect Exploration vs. Exploitation? A Tale of Two Recommendation Algorithms

Author

Listed:
  • H. Henry Cao

    (Department of Finance, Cheung Kong Graduate School of Business, Beijing 100006, China)

  • Liye Ma

    (Department of Marketing, Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742)

  • Z. Eddie Ning

    (Department of Marketing and Behavioural Science, Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z4, Canada)

  • Baohong Sun

    (Department of Marketing, Cheung Kong Graduate School of Business, Beijing 100006, China)

Abstract

Through repeated interactions, firms today refine their understanding of individual users’ preferences adaptively for personalization. In this paper, we use a continuous-time bandit model to analyze firms that recommend content to multihoming consumers, a representative setting for strategic learning of consumer preferences to maximize lifetime value. In both monopoly and duopoly settings, we compare a forward-looking recommendation algorithm that balances exploration and exploitation to a myopic algorithm that only maximizes the quality of the next recommendation. Our analysis shows that, compared with a monopoly, firms competing for users’ attention focus more on exploitation than exploration. When users are impatient, competition decreases the return from developing a forward-looking algorithm. In contrast, development of a forward-looking algorithm may hurt users under monopoly but always benefits users under competition. Competing firms’ decisions to invest in a forward-looking algorithm can create a prisoner’s dilemma. Our results have implications for artificial intelligence adoption and for policy makers on the effect of market power on innovation and consumer welfare.

Suggested Citation

  • H. Henry Cao & Liye Ma & Z. Eddie Ning & Baohong Sun, 2024. "How Does Competition Affect Exploration vs. Exploitation? A Tale of Two Recommendation Algorithms," Management Science, INFORMS, vol. 70(2), pages 1029-1051, February.
  • Handle: RePEc:inm:ormnsc:v:70:y:2024:i:2:p:1029-1051
    DOI: 10.1287/mnsc.2023.4722
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2023.4722
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2023.4722?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:ormnsc:v:70:y:2024:i:2:p:1029-1051. 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.