A stochastic matching model on hypergraphs

International audienceMotivated by applications to a wide range of assemble-to-order systems, operations scheduling, healthcare systems and collaborative economy applications, we introduce a stochastic matching model on hypergraphs, extending the model in [15] 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 by groups of two or more. We study the stability of this stochastic system, for various hypergraph geometries