A stochastic matching model on hypergraphs. (December 2021)

• Record Type: Journal Article
• Authors: Rahme, Youssef; Moyal, Pascal
• Is Part Of: Advances in applied probability. Volume 53:Number 4(2021)
• Page Start: 951
• Page End: 980
• Publication Date: 2021-12
• Subjects: Markovian queueing theory -- stability -- matching -- hypergraph; 60J10 -- 68M20 -- 05C65; Probabilities -- Periodicals; Stochastic models -- Periodicals; Electronic journals; Periodicals; 519.2
• DOI: 10.1017/apr.2021.8
• Languages: English
• ISSNs: 0001-8678

Abstract

Abstract: Motivated by applications to a wide range of areas, including assemble-to-order systems, operations scheduling, healthcare systems, and the collaborative economy, we study a stochastic matching model on hypergraphs, extending the model of Mairesse and Moyal ( J. Appl. Prob. 53, 2016) to the case of hypergraphical (rather than graphical) matching structures. We address a discrete-event system under a random input of single items, simply using the system as an interface to be matched in groups of two or more. We primarily study the stability of this model, for various hypergraph geometries.