Technical note: on hiring secretaries with stochastic departures
Year of publication: |
2024
|
---|---|
Authors: | Kesselheim, Thomas ; Psomas, Alexandros ; Vardi, Shai |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 72.2024, 5, p. 2076-2081
|
Subject: | online algorithms | Optimization | secretary problem | stopping problems | Algorithmus | Algorithm | Suchtheorie | Search theory | Stochastischer Prozess | Stochastic process | Mathematische Optimierung | Mathematical programming | Personalbeschaffung | Recruitment |
-
A simple O(log log(rank))-competitive algorithm for the matroid secretary problem
Feldman, Moran, (2018)
-
Strong algorithms for the ordinal matroid secretary problem
Soto, José A., (2021)
-
Hiring secretaries over time : the benefit of concurrent employment
Disser, Yann, (2020)
- More ...
-
Dynamic fair resource division
Vardi, Shai, (2022)
-
Truthful mechanisms for two-sided markets via prophet inequalities
Braun, Alexander, (2023)
-
Algorithms as mechanisms : the price of anarchy of relax and round
Dütting, Paul, (2021)
- More ...