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

Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities

Author

Listed:
  • Jose H. Blanchet

    (Management Science and Engineering Department, Stanford University, Stanford, California 94305)

  • Martin I. Reiman

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

  • Virag Shah

    (Management Science and Engineering Department, Stanford University, Stanford, California 94305)

  • Lawrence M. Wein

    (Graduate School of Business, Stanford University, Stanford, California 94305)

  • Linjia Wu

    (Management Science and Engineering Department, Stanford University, Stanford, California 94305)

Abstract

We consider a matching market where buyers and sellers arrive according to independent Poisson processes at the same rate and independently abandon the market if not matched after an exponential amount of time with the same mean. In this centralized market, the utility for the system manager from matching any buyer and any seller is a general random variable. We consider a sequence of systems indexed by n where the arrivals in the n th system are sped up by a factor of n . We analyze two families of one-parameter policies: the population threshold policy immediately matches an arriving agent to its best available mate only if the number of mates in the system is above a threshold, and the utility threshold policy matches an arriving agent to its best available mate only if the corresponding utility is above a threshold. Using an asymptotic fluid analysis of the two-dimensional Markov process of buyers and sellers, we show that when the matching utility distribution is light-tailed, the population threshold policy with threshold n ln n is asymptotically optimal among all policies that make matches only at agent arrival epochs. In the heavy-tailed case, we characterize the optimal threshold level for both policies. We also study the utility threshold policy in an unbalanced matching market with heavy-tailed matching utilities and find that the buyers and sellers have the same asymptotically optimal utility threshold. To illustrate our theoretical results, we use extreme value theory to derive optimal thresholds when the matching utility distribution is exponential, uniform, Pareto, and correlated Pareto. In general, we find that as the right tail of the matching utility distribution gets heavier, the threshold level of each policy (and hence market thickness) increases, as does the magnitude by which the utility threshold policy outperforms the population threshold policy.

Suggested Citation

  • Jose H. Blanchet & Martin I. Reiman & Virag Shah & Lawrence M. Wein & Linjia Wu, 2022. "Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities," Operations Research, INFORMS, vol. 70(6), pages 3355-3370, November.
  • Handle: RePEc:inm:oropre:v:70:y:2022:i:6:p:3355-3370
    DOI: 10.1287/opre.2021.2186
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.2021.2186?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:6:p:3355-3370. 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.