A stochastic matching model on hypergraphs
From MaRDI portal
Publication:5013243
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Abstract: Motivated 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.
Recommendations
- A general stochastic matching model on multigraphs
- Stochastic matching on uniformly sparse graphs
- On matchings in stochastic Kronecker graphs
- On matchings in hypergraphs
- The stochastic stability of decentralized matching on a graph
- The matching process and independent process in random regular graphs and hypergraphs
- Almost perfect matchings in random uniform hypergraphs
- On a hypergraph matching problem
- Matchings and flows in hypergraphs
- Greedy matching in bipartite random graphs
Cites work
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- A condition for matchability in hypergraphs
- A new look at organ transplantation models and double matching queues
- A product form for the general stochastic matching model
- Dynamic matching for real-time ride sharing
- Exact FCFS matching rates for two infinite multitype sequences
- Fcfs infinite bipartite matching of servers and customers
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Fluid and diffusion approximations of probabilistic matching systems
- Markov Chains
- On the dynamic control of matching queues
- On the instability of matching queues
- Reversibility and further properties of FCFS infinite bipartite matching
- Reward maximization in general dynamic matching systems
- Stability of the bipartite matching model
- Stability of the stochastic matching model
- Stabilizing policies for probabilistic matching systems
- Topics in the Constructive Theory of Countable Markov Chains
Cited in
(10)- Editorial introduction: Special issue on product forms, stochastic matching, and redundancy
- A product form for the general stochastic matching model
- Multi-component matching queues in heavy traffic
- Stability regions of systems with compatibilities and ubiquitous measures on graphs
- Stability of the stochastic matching model
- Emergence and dynamics of short food supply chains
- A general stochastic matching model on multigraphs
- On the sub-additivity of stochastic matching
- Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancy
- A natural barrier in random greedy hypergraph matching
This page was built for publication: A stochastic matching model on hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013243)
