An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals

We present an optimally-competitive algorithm for the problem of maximum online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given a known set of workers, a distribution over job types, and non-negative utility weights for each pair of worker and job types. At each time s...

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 64; číslo 4; s. 645 - 661
Hlavní autori:	Chang, Minjun, Hochbaum, Dorit S., Spaen, Quico, Velednitsky, Mark
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2020 Springer Nature B.V
Predmet:	Algorithms Arrivals Competition Computer Science Matching Optimization Special Issue on Approximation and Online Algorithms 2018 Theory of Computation Transportation problem Utilities Competitive ratio i.i.d. arrivals Perfect matching
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!