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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 64; H. 4; S. 645 - 661
Hauptverfasser:	Chang, Minjun, Hochbaum, Dorit S., Spaen, Quico, Velednitsky, Mark
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2020 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!