10 papers
Online Budget-Feasible Mechanism Design with Predictions
Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios +3
Augmenting the input of algorithms with predictions is an algorithm design paradigm that suggests leveraging a (possibly erroneous) prediction to improve worst-case performance gua…
Online Fair Division Meets Reordering Buffers
Georgios Amanatidis, Giulio Giaconi, Evangelos Markakis +1
We study the online fair division of indivisible mixed manna among agents with additive valuation functions. Under the standard online model, at each time step an indivisible item…
Improved Approximation Guarantees for Groupwise Maximin Share Fairness
Georgios Amanatidis, Anna Korfiati, Evangelos Markakis +1
We study the problem of fairly allocating a set of indivisible goods to a set of agents with additive valuation functions. We focus on the very demanding notion of \textit{grou…
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…
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…