Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Garbuz, Tamar"'
Autor:
Ezra, Tomer, Garbuz, Tamar
We study the classic single-choice prophet secretary problem through a resource augmentation lens. Our goal is to bound the $(1-\epsilon)$-competition complexity for different classes of online algorithms. This metric asks for the smallest $k$ such t
Externí odkaz:
http://arxiv.org/abs/2411.10892
Autor:
Ezra, Tomer, Garbuz, Tamar
We initiate the study of the prophet inequality problem through the resource augmentation framework in scenarios when the values of the rewards are correlated. Our goal is to determine the number of additional rewards an online algorithm requires to
Externí odkaz:
http://arxiv.org/abs/2409.06868
Autor:
Ezra, Tomer, Garbuz, Tamar
We study the measure of order-competitive ratio introduced by Ezra et al. [2023] for online algorithms in Bayesian combinatorial settings. In our setting, a decision-maker observes a sequence of elements that are associated with stochastic rewards th
Externí odkaz:
http://arxiv.org/abs/2307.02610