IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v107y2024i3d10.1007_s11134-024-09924-z.html
   My bibliography  Save this article

Performance paradox of dynamic matching models under greedy policies

Author

Listed:
  • Bušić Ana

    (INRIA
    PSL Research University)

  • Cadas Arnaud

    (INRIA
    PSL Research University)

  • Doncel Josu

    (University of the Basque Country, UPV-EHU)

  • Fourneau Jean-Michel

    (INRIA
    Université Paris-Saclay)

Abstract

We consider the stochastic matching model on a non-bipartite compatibility graph and analyze the impact of adding an edge to the expected number of items in the system. One may see adding an edge as increasing the flexibility of the system, for example, asking a family registering for social housing to list fewer requirements in order to be compatible with more housing units. Therefore, it may be natural to think that adding edges to the compatibility graph will lead to a decrease in the expected number of items in the system and the waiting time to be assigned. In our previous work, we proved this is not always true for the First Come First Matched discipline and provided sufficient conditions for the existence of the performance paradox: despite a new edge in the compatibility graph, the expected total number of items can increase. These sufficient conditions are related to the heavy-traffic assumptions in queueing systems. The intuition behind this is that the performance paradox occurs when the added edge in the compatibility graph disrupts the draining of a bottleneck. In this paper, we generalize this performance paradox result to a family of so-called greedy matching policies and explore the type of compatibility graphs where such a paradox occurs. Intuitively, a greedy matching policy never leaves compatible items unassigned, so the state space of the system consists of finite words of item classes that belong to an independent set of the compatibility graph. Some examples of greedy matching policies are First Come First Match, Match the Longest, Match the Shortest, Random, Priority. We prove several results about the existence of performance paradoxes for greedy disciplines for some family of graphs. More precisely, we prove several results about the lifting of the paradox from one graph to another one. For a certain family of graphs, we prove that there exists a paradox for the whole family of greedy policies. Most of these results are based on strong aggregation of Markov chains and graph theoretical properties.

Suggested Citation

  • Bušić Ana & Cadas Arnaud & Doncel Josu & Fourneau Jean-Michel, 2024. "Performance paradox of dynamic matching models under greedy policies," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 257-293, September.
    • Handle: RePEc:spr:queues:v:107:y:2024:i:3:d:10.1007_s11134-024-09924-z
    DOI: 10.1007/s11134-024-09924-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-024-09924-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-024-09924-z?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.

    References listed on IDEAS

    as
    1. Kristen Gardner & Samuel Zbarsky & Sherwin Doroudi & Mor Harchol-Balter & Esa Hyytiä & Alan Scheller-Wolf, 2016. "Queueing with redundant requests: exact analysis," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 227-259, August.
    2. Ivo Adan & Gideon Weiss, 2012. "Exact FCFS Matching Rates for Two Infinite Multitype Sequences," Operations Research, INFORMS, vol. 60(2), pages 475-489, April.
    3. Gideon Weiss, 2020. "Directed FCFS infinite bipartite matching," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 387-418, December.
    4. Kristen Gardner & Rhonda Righter, 2020. "Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 3-51, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    2. Gideon Weiss, 2020. "Directed FCFS infinite bipartite matching," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 387-418, December.
    3. Kristen Gardner & Pascal Moyal, 2024. "Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancy," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 199-203, September.
    4. Jan-Pieter Dorsman & Kristen Gardner, 2024. "New directions in pass-and-swap queues," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 205-256, September.
    5. Céline Comte & Jan-Pieter Dorsman, 2021. "Pass-and-swap queues," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 275-331, August.
    6. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    7. Jocelyn Begeot & Irène Marcovici & Pascal Moyal, 2023. "Stability regions of systems with compatibilities and ubiquitous measures on graphs," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 275-312, April.
    8. Kristen Gardner & Rhonda Righter, 2022. "The cost of collaboration," Queueing Systems: Theory and Applications, Springer, vol. 100(1), pages 7-40, February.
    9. Kristen Gardner & Rhonda Righter, 2020. "Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 3-51, October.
    10. Gideon Weiss, 2022. "Parallel multi-type many server conjecture," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 269-271, April.
    11. Jose H. Blanchet & Martin I. Reiman & Viragh Shah & Lawrence M. Wein & Linjia Wu, 2020. "Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities," Papers 2002.03205, arXiv.org, revised Jun 2021.
    12. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    13. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
    14. Burak Büke & Hanyi Chen, 2017. "Fluid and diffusion approximations of probabilistic matching systems," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 1-33, June.
    15. Jingui Xie & Yiming Fan & Mabel C. Chou, 2017. "Flexibility design in loss and queueing systems: efficiency of k-chain configuration," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 286-308, June.
    16. P. Moyal & A. Bušić & J. Mairesse, 2024. "On the sub-additivity of stochastic matching," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 295-339, September.
    17. Cardinaels, Ellen & Borst, Sem & van Leeuwaarden, Johan S.H., 2024. "Heavy-traffic universality of redundancy systems with assignment constraints," Other publications TiSEM 1ab2791a-b085-466e-8ada-e, Tilburg University, School of Economics and Management.
    18. Leela Nageswaran, 2023. "Implications of vaccine shopping during pandemic," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1133-1149, April.
    19. Ross Anderson & Itai Ashlagi & David Gamarnik & Yash Kanoria, 2017. "Efficient Dynamic Barter Exchange," Operations Research, INFORMS, vol. 65(6), pages 1446-1459, December.
    20. Frank Kelly & Elena Yudovina, 2015. "A Markov model of a limit order book: thresholds, recurrence, and trading strategies," Papers 1504.00579, arXiv.org, revised Mar 2017.

    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:spr:queues:v:107:y:2024:i:3:d:10.1007_s11134-024-09924-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.