5 papers
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
We study prophet inequalities under intersections of partition matroids, where an online algorithm irrevocably selects elements with independent nonnegative values drawn from k…
Online Sorting with Our Eyes Wide Shut
Charalampos Platanos, Thanos Tolias
In Online Sorting, we are given an array of initially empty cells. At each time step , an element arrives and must be placed irrevocably into an empt…
Online Resource Allocation via Static Bundle Pricing
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
Online Resource Allocation addresses the problem of efficiently allocating limited resources to buyers with incomplete knowledge of future requests. In our setting, buyers arrive s…
A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
Andreas Kalavas, Charalampos Platanos, Thanos Tolias
In \emph{Online Sorting}, an array of initially empty cells is given. At each time step , an element arrives and must be placed irrevocably into an empty cel…
A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
Andreas Kalavas, Charalampos Platanos, Thanos Tolias
In \emph{Online Sorting}, an array of initially empty cells is given. At each time step , an element arrives and must be placed irrevocably into an empty cel…