Hiring Secretaries over Time: The Benefit of Concurrent Employment

We consider a stochastic online problem where n applicants arrive over time, one per time step. Upon the arrival of each applicant, their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. This decision is irrevocable; that is, we can neither extend...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematics of operations research 2020-02, Vol.45 (1), p.323-352
Hauptverfasser:	Disser, Yann, Fearnley, John, Gairing, Martin, Göbel, Oliver, Klimm, Max, Schmand, Daniel, Skopalik, Alexander, Tönnis, Andreas
Format:	Artikel
Sprache:	eng
Schlagworte:	62L15 68Q87 68W27 Algorithms Candidates Competition Costs Employment Hiring Lower bounds Markov chain Multitasking online algorithm Operations research Primary: 60G40 Primary: computers/computer science, analysis of algorithms prophet inequality secondary: 68W40 secondary: probability: Markov processes secretary problem stopping problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!