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

Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation

Author

Listed:
  • Vineet Goyal

    (Industrial Engineering and Operations Research (IEOR), Columbia University, New York, New York 10027)

  • Rajan Udwani

    (Industrial Engineering and Operations Research (IEOR), University of California, Berkeley, Berkeley, California 94720)

Abstract

The problem of online matching with stochastic rewards is a generalization of the online bipartite matching problem where each edge has a probability of success. When a match is made it succeeds with the probability of the corresponding edge. We consider the more general vertex-weighted version of the problem and give two new results. First, we show that a natural generalization of the perturbed-greedy algorithm is ( 1 − 1 / e ) competitive when probabilities decompose as a product of two factors, one corresponding to each vertex of the edge. This is the best achievable guarantee as it includes the case of identical probabilities and, in particular, the classical online bipartite matching problem. Second, we give a deterministic 0.596 competitive algorithm for the previously well-studied case of fully heterogeneous but vanishingly small edge probabilities. A key contribution of our approach is the use of novel path-based formulations and a generalization of the primal-dual scheme. These allow us to compare against the natural benchmarks of adaptive offline algorithms that know the sequence of arrivals and the edge probabilities in advance but not the outcomes of potential matches. These ideas may be of independent interest in other online settings with postallocation stochasticity.

Suggested Citation

  • Vineet Goyal & Rajan Udwani, 2023. "Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation," Operations Research, INFORMS, vol. 71(2), pages 563-580, March.
    • Handle: RePEc:inm:oropre:v:71:y:2023:i:2:p:563-580
    DOI: 10.1287/opre.2022.2345
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2345
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.2345?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:71:y:2023:i:2:p:563-580. 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.