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

Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience

Author

Listed:
  • Brian Brubach

    (Computer Science Department, Wellesley College, Wellesley, Massachusetts 02481)

  • Nathaniel Grammel

    (Department of Computer Science, University of Maryland, College Park, Maryland 20742)

  • Will Ma

    (Graduate School of Business and Data Science Institute, Columbia University, New York, New York 10027)

  • Aravind Srinivasan

    (Department of Computer Science, University of Maryland, College Park, Maryland 20742)

Abstract

We study generalizations of online bipartite matching in which each arriving vertex (customer) views a ranked list of offline vertices (products) and matches to (purchases) the first one they deem acceptable. The number of products that the customer has patience to view can be stochastic and dependent on the products seen. We develop a framework that views the interaction with each customer as an abstract resource consumption process and derive new results for these online matching problems under the adversarial, nonstationary, and independent and identically-distributed arrival models, assuming we can (approximately) solve the product ranking problem for each single customer. To that end, we show new results for product ranking under two cascade-click models: an optimal algorithm when each item has its own hazard rate for making the customer depart and a 1/2-approximate algorithm when the customer has a general item-independent patience distribution. We also present a constant-factor 0.027-approximate algorithm in a new model where items are not initially available and arrive over time. We complement these positive results by presenting three additional negative results relating to these problems.

Suggested Citation

  • Brian Brubach & Nathaniel Grammel & Will Ma & Aravind Srinivasan, 2025. "Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience," Operations Research, INFORMS, vol. 73(2), pages 995-1010, March.
    • Handle: RePEc:inm:oropre:v:73:y:2025:i:2:p:995-1010
    DOI: 10.1287/opre.2021.0371
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2021.0371
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2021.0371?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
    ---><---

    More about this item

    Keywords

    Optimization;

    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:inm:oropre:v:73:y:2025:i:2:p:995-1010. 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.