activity
20162026
most citedFair Division of Indivisible Goods: Recent Progress and Open Questions

93 citations · 237 across the 19 of their papers we have counts for

collaborators

23 papers

cs.GT2026

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…

cs.GT2026

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…

cs.GT2024

Reward Schemes and Committee Sizes in Proof of Stake Governance

Georgios Birmpas, Philip Lazos, Evangelos Markakis +1

In this paper, we investigate the impact of reward schemes and committee sizes motivated by governance systems over blockchain communities. We introduce a model for elections with…

cs.DS2024

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…

cs.GT2023

Fair Division with Interdependent Values

Georgios Birmpas, Tomer Ezra, Stefano Leonardi +1

We introduce the study of designing allocation mechanisms for fairly allocating indivisible goods in settings with interdependent valuation functions. In our setting, there is a se…

cs.GT2023★ 1 cited

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…