10 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…
The Knapsack Secretary Problem is Strictly Harder Than the Secretary Problem
Eric Balkanski, Jason Chatzitheodorou, Dimitris Fotakis +1
The knapsack secretary problem is a generalization of the classical secretary problem where the accepted items must satisfy a knapsack constraint. A line of work has developed cons…
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…
Repeated Descent: A Framework for Online Budget-Feasible Auctions
Andreas Charalampopoulos, Dimitris Fotakis, Thanos Tolias
We study budget feasible procurement auctions, in which agents, each with a privately held service cost, offer their services to an employer. The employer seeks to maximize a p…
Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
Sotiris Kanellopoulos, Giorgos Mitropoulos, Christos Pergaminelis +1
The k-Visits problem is a recently introduced finite version of Pinwheel Scheduling [Kanellopoulos et al., SODA 2026]. Given the deadlines of n tasks, the problem asks whether ther…
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…
An algorithm for accurate and simple-looking metaphorical maps
Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis +1
"Metaphorical maps" or "contact representations" are visual representations of vertex-weighted graphs that rely on the geographic map metaphor. The vertices are represented by coun…
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 Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
Andreas Charalampopoulos, Dimitris Fotakis, Panagiotis Patsilinakos +1
We consider online procurement auctions, where the agents arrive sequentially, in random order, and have private costs for their services. The buyer aims to maximize a monotone sub…