25 citations · 55 across the 9 of their papers we have counts for
10 papers
Generalized Prophet Inequalities for Online Auctions
Twan Kroll, Rebecca Reiffenhäuser
Prophet Inequalities for online auctions, as many classical auction settings, traditionally consider agents who strive to maximize quasi-linear utility, i.e. their obtained value m…
Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees
Georgios Amanatidis, Georgios Birmpas, Rebecca Reiffenhäuser
With strong evidence in the literature showing that fairness and truthfulness are incompatible, there is a recent line of work focusing on the fairness properties of equilibria of…
Pandora's Box Problem With Time Constraints
Georgios Amanatidis, Ben Berger, Tomer Ezra +4
The Pandora's Box problem models the search for the best alternative when evaluation is costly. In the simplest variant, a decision maker is presented with boxes, each associat…
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…
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Georgios Amanatidis, Georgios Birmpas, Philip Lazos +2
Fair allocation of indivisible goods has attracted extensive attention over the last two decades, yielding numerous elegant algorithmic results and producing challenging open quest…
Truthful Matching with Online Items and Offline Agents
Michal Feldman, Federico Fusco, Stefano Leonardi +2
We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired se…
Prophet Inequalities via the Expected Competitive Ratio
Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser +2
We consider prophet inequalities under downward-closed constraints. In this problem, a decision-maker makes immediate and irrevocable choices on arriving elements, subject to const…
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,…
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Georgios Amanatidis, Georgios Birmpas, Federico Fusco +3
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefo…
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…