A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Knapsack Secretary with Bursty Adversary
2020
International Colloquium on Automata, Languages and Programming
The random-order or secretary model is one of the most popular beyond-worst case model for online algorithms. While this model avoids the pessimism of the traditional adversarial model, in practice we cannot expect the input to be presented in perfectly random order. This has motivated research on best of both worlds (algorithms with good performance on both purely stochastic and purely adversarial inputs), or even better, on inputs that are a mix of both stochastic and adversarial parts.
doi:10.4230/lipics.icalp.2020.72
dblp:conf/icalp/KesselheimM20
fatcat:jyi6ei3v2zemlo2lrnr75bu2nm