We study threshold testing, an elementary probing model with the goal to...
In this work we initiate the study of buy-and-sell prophet inequalities....
We consider the problem of finding an incremental solution to a
cardinal...
A searcher faces a graph with edge lengths and vertex weights, initially...
We revisit the Stochastic Score Classification (SSC) problem introduced ...
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007)...
We consider the online search problem in which a server starting at the
...
We revisit the fully online matching model (Huang et al., J. ACM, 2020),...
The speed-robust scheduling problem is a two-stage problem where given m...
The model of streaming algorithms is motivated by the increasingly commo...
We devise a constant-factor approximation algorithm for the maximization...
We consider a fundamental online scheduling problem in which jobs with
p...
Numerous combinatorial optimization problems (knapsack, maximum-weight
m...
We study a fundamental online job admission problem where jobs with dead...
A central object in optimal stopping theory is the single-choice prophet...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are g...