Fcfs infinite bipartite matching of servers and customers
Advances in Applied Probability · 2009-09 · 41 (3) · 695-730
DOI: 10.1239/aap/1253281061 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Applied Probability, online erschienen am 01.07.2016. Verfasst von René Caldentey und 2 weiteren Autor:innen. Die Arbeit wurde bisher 96-mal zitiert (Crossref) und nennt 21 Literaturangaben.
Abstract (Originalsprache)
We consider an infinite sequence of customers of types and an infinite sequence of servers of types where a server of type j can serve a subset of customer types C ( j ) and where a customer of type i can be served by a subset of server types S ( i ). We assume that the types of customers and servers in the infinite sequences are random, independent, and identically distributed, and that customers and servers are matched according to their order in the sequence, on a first-come–first-served (FCFS) basis. We investigate this process of infinite bipartite matching. In particular, we are interested in the rate r i , j that customers of type i are assigned to servers of type j . We present a countable state Markov chain to describe this process, and for some previously unsolved instances, we prove ergodicity and existence of limiting rates, and calculate r i , j .
Zitieren
APA
Caldentey, R., Kaplan, E. H., & Weiss, G. (2009). Fcfs infinite bipartite matching of servers and customers. Advances in Applied Probability, 41(3), 695-730. https://doi.org/10.1239/aap/1253281061
Vancouver
Caldentey R, Kaplan EH, Weiss G. Fcfs infinite bipartite matching of servers and customers. Advances in Applied Probability. 2009;41(3):695-730. doi:10.1239/aap/1253281061
BibTeX
@article{Caldentey2009,
author = {Caldentey, René and Kaplan, Edward H. and Weiss, Gideon},
title = {Fcfs infinite bipartite matching of servers and customers},
journal = {Advances in Applied Probability},
year = {2009},
volume = {41},
number = {3},
pages = {695--730},
doi = {10.1239/aap/1253281061}
}
EUVIMED