Vasilis Christoforidis — accepted AI-conference papers

2025

Maximin Share Guarantees for Few Agents with Subadditive Valuations

George Christodoulou, Vasilis Christoforidis, Symeon Mastrakoulis, Alkmini Sgouritsa

IJCAI 2025

We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of 1/2 (which is tight) for the case of subadditive valuations when the number of agents is at most four. We

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

On the Pursuit of EFX for Chores: Non-existence and Approximations

Vasilis Christoforidis, Christodoulos Santorinaios

IJCAI 2024poster

We study the problem of fairly allocating a set of chores to a group of agents. The existence of envy-free up to any item (EFX) allocations is a long-standing open question for both goods and chores. We resolve this question by providing a negative answer for the latter, presenting a simple construc…

Cited by 11 Source ↗PDF ↗Scholar ↗