Leveraging Matchings in Constrained Fair Division with a Conflict Graph

Evangelos Markakis, Michalis Samaris

We study the problem of allocating indivisible goods under constraints, expressed via a conflict graph $G$. In such an instance, the $m$ items are the vertices of $G$ and connected…