5 papers
A Note on EFX Inapproximability for Chores
Vasilis Christoforidis
We study the approximability of EFX allocations for indivisible chores under complement-free cost functions. The non-existence of exact EFX allocations for general monotone functio…
Improving the Price of Anarchy via Predictions in Parallel-Link Networks
George Christodoulou, Vasilis Christoforidis, Alkmini Sgouritsa +1
We study non-atomic congestion games on parallel-link networks with affine cost functions. We investigate the power of machine-learned predictions in the design of coordination mec…
Fair and Truthful Allocations Under Leveled Valuations
George Christodoulou, Vasilis Christoforidis
We study the problem of fairly allocating indivisible goods among agents which are equipped with {\em leveled} valuation functions. Such preferences, that have been studied before…
Maximin Share Guarantees for Few Agents with Subadditive Valuations
George Christodoulou, Vasilis Christoforidis, Symeon Mastrakoulis +1
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 l…
On The Pursuit of EFX for Chores: Non-Existence and Approximations
Vasilis Christoforidis, Christodoulos Santorinaios
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 bot…