Abstract
We consider an infinite sequence consisting of agents of several types and goods of several types, with a bipartite compatibility graph between agent and good types. Goods are matched with agents that appear earlier in the sequence using FCFS matching, if such are available, and are lost otherwise. This model may be used for two-sided queueing applications such as ride sharing, Web purchases, organ transplants, and for parallel redundant service queues. For this model, we calculate matching rates and delays. These can be used to obtain waiting times and help with design questions for related service systems. We explore some relations of this model to other FCFS stochastic matching models.
| Original language | English |
|---|---|
| Pages (from-to) | 387-418 |
| Number of pages | 32 |
| Journal | Queueing Systems |
| Volume | 96 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Dec 2020 |
Bibliographical note
Funding Information:Research supported in part by Israel Science Foundation Grant 286/13. Part of this work was done while the author was visiting the Simons Institute for the Theory of Computing.
Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Dynamic online matching
- FCFS matching
- Matching delays
- Matching rates
- Parallel service systems
- Two-sided queues
ASJC Scopus subject areas
- Statistics and Probability
- Computer Science Applications
- Management Science and Operations Research
- Computational Theory and Mathematics