Performance Paradox of Dynamic Matching Models under Greedy Policies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Performance Paradox of Dynamic Matching Models under Greedy Policies

Abstract

We consider the stochastic matching model on a non-bipartite matching 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 less requirements in order to be compatible with more housing units. Therefore it may be natural to think that adding edges to the matching graph will lead to a decrease of the expected number of items in the system and the waiting time to be matched. In our previous work, and 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 matching 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 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 matching graphs where such paradoxes occur. Intuitively, a greedy matching policy never leaves compatible items unmatched, so the state space of the system consists of finite words of item classes that belong to an independent set of the matching graph. Some examples of greedy Performance Paradox of Dynamic Matching Models under Greedy Policies matching policies are First Come First Match, Match the Longest, Match the Shortest, Random selection, 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.
Fichier principal
Vignette du fichier
Paradox.pdf (592.5 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04137823 , version 1 (22-06-2023)

Licence

Identifiers

  • HAL Id : hal-04137823 , version 1

Cite

Bušić Ana, Cadas Arnaud, Josu Doncel, Fourneau Jean-Michel. Performance Paradox of Dynamic Matching Models under Greedy Policies. 2023. ⟨hal-04137823⟩
54 View
27 Download

Share

Gmail Mastodon Facebook X LinkedIn More