25 citations · 124 across the 24 of their papers we have counts for
7 papers · 1 filter
Algorithmically Fair Maximization of Multiple Submodular Objective Functions and Implications to Constrained Fair Division
Georgios Amanatidis, Georgios Birmpas, Philip Lazos +2
Constrained maximization of submodular functions is a central problem in combinatorial optimization. In many realistic scenarios, multiple agents each need to maximize their own su…
Single-Sample Prophet Inequalities via Greedy-Ordered Selection
Constantine Caramanis, Paul Dütting, Matthew Faw +6
We study single-sample prophet inequalities (SSPIs), i.e., prophet inequalities where only a single sample from each prior distribution is available. Besides a direct, and optimal,…
Prophet Inequalities for Matching with a Single Sample
Paul Dütting, Federico Fusco, Philip Lazos +2
We consider the prophet inequality problem for (not necessarily bipartite) matching problems with independent edge values, under both edge arrivals and vertex arrivals. We show con…
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Georgios Amanatidis, Federico Fusco, Philip Lazos +3
Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances moti…
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Georgios Amanatidis, Federico Fusco, Philip Lazos +2
Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral mar…
Reallocating Multiple Facilities on the Line
Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis +3
We study the multistage -facility reallocation problem on the real line, where we maintain facility locations over stages, based on the stage-dependent locations of …
The Infinite Server Problem
Christian Coester, Elias Koutsoupias, Philip Lazos
We study a variant of the -server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a s…