The matroid secretary problem admits several variants according to the order in which the matroid’s elements are presented and how the elements are assigned weights. As the main result of this article, we devise the first ...

In the ordinal matroid secretary problem (MSP), candidates do not reveal numerical weights, but the decision maker can still discern if a candidate is better than another. An algorithm alpha is probability-competitive if ...

In the classic prophet inequality, a well-known problem in optimal stopping theory, samples from independent random variables (possibly differently distributed) arrive online. A gambler who knows the distributions, but ...

In this thesis, we study from a sample-based perspective four online selection problems that generalize two classic models: the secretary problem and the prophet inequality. In the first chapter, we propose a model we ...