Performance paradox of dynamic bipartite matching models

DOI10.1007/978-3-031-78600-6_5MaRDI QIDQ6981473zbMATH OpenFDO

Authors Iratxe Iriondo, Josu Doncel

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78600-6_5

zbMATH Keywords

bipartite matching modelsMarkov chainsperformance paradox

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Matching models (91B68)

Cites work

• Exact FCFS matching rates for two infinite multitype sequences
• Fcfs infinite bipartite matching of servers and customers
• Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
• Stability of the bipartite matching model
• Stability of the stochastic matching model

This page was built for publication: Performance paradox of dynamic bipartite matching models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981473)