8 papers
EFX Allocation In (Multi)Hypergraphs
Thanasis Lianeas, Alkmini Sgouritsa, Minas Marios Sotiriou
We study fair allocations of indivisible goods among agents with heterogeneous monotone valuations. As fair we consider the allocations that are envy-free-up-to-any-good (EFX). Fin…
Almost EFX in Hypergraphs
Ioannis Kakatelis, Thanasis Lianeas, Alkmini Sgouritsa +1
We study the existence of envy-free-up-to-any-good (EFX) allocations of indivisible goods among agents with heterogeneous monotone valuations. Christodoulou et al. (2023) introduce…
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…
Pushing the Frontier on Approximate EFX Allocations
Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa
We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good (…
EF2X Exists For Four Agents
Arash Ashuri, Vasilis Gkatzelis, Alkmini Sgouritsa
We study the fair allocation of indivisible goods among a group of agents, aiming to limit the envy between any two agents. The central open problem in this literature, which has p…
On the existence of EFX allocations in multigraphs
Alkmini Sgouritsa, Minas Marios Sotiriou
We study the problem of "fairly" dividing indivisible goods to several agents that have valuation set functions over the sets of goods. As fair we consider the allocations that are…