4 papers
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…
Position Auctions with a Capacity Constraint
Eleni Batziou, Georgios Birmpas, Georgios Chionas +1
Sponsored search auctions are commonly modeled as an assignment of a fixed set of slots (positions) to a set of advertisers, with welfare maximization being reducible to a standard…
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria
Georgios Birmpas, Lyudmila Kovalchuk, Philip Lazos +1
Motivated by the intricacies of allocating treasury funds in blockchain settings, we study the problem of crowdsourcing reviews for many different proposals, in parallel. During th…