Algorithms for Constrained Fair Division Problems

Prelegent(ci)

Evangelos Markakis

Afiliacja

Athens University of Economics and Business

Język referatu

angielski

Termin

29 października 2026 12:15

Pokój

p. 4060

Seminarium

Seminarium „Ekonomia algorytmiczna”

---

In this talk, we will provide an overview of recent research on fair division of indivisible resources in the presence of constraints. In contrast to the classic fair division setting, we will discuss two variations of the problem where constraints are imposed on the set of feasible allocations. The first one has to do with cardinality constraints on the bundle size assigned to each agent, motivated by assigning shifts or forming equally sized teams. The second one concerns incompatibilities among items and is modeled by a conflict graph, with the meaning that any two items connected by an edge in the graph cannot be given to the same agent. For both of these models we will discuss the existence and computation of allocations that satisfy fairness criteria such as EF1 and EFX (and their appropriate adaptations in these settings).

Based on joint works with Alviona Mantso, Nicos Protopapas, Michalis Samaris.

---