14 citations · 49 across the 47 of their papers we have counts for
Showing 2023 · cs.GTShow all
2 papers · 2 filters
cs.GT2023★ 1 cited
The Complexity of Fair Division of Indivisible Items with Externalities
Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna +1
We study the computational complexity of fairly allocating a set of indivisible items under externalities. In this recently-proposed setting, in addition to the utility the agent g…
cs.GT2023★ 1 cited
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems
Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordinati…