12 papers
Network Allocation Games with Anonymous Preferences
Argyrios Deligkas, Eduard Eiben, Å imon Schierreich +1
We study network allocation games in which a set of agents must be allocated to (a subset of) the vertices of a graph topology. The agents are anonymous and strategic: Each of them…
Discrete Truthful Heterogeneous Two-Facility Location: The Line and Beyond
Panagiotis Kanellopoulos, Alexandros A. Voudouris
We study deterministic strategyproof mechanisms for discrete heterogeneous two-facility location. In our model, agents occupy distinct nodes of a connected graph and privately…
Metric Facility Assignment with Partial Information
Vasilis Gkatzelis, Hasti Karimi, Emma Rewinski +2
We study an assignment problem where a set of agents and a set of facilities lie on a line metric. The goal is to compute an assignment of agents to facilities to approximately min…
Approximate-EFX Allocations with Ordinal and Limited Cardinal Information
Aris Filos-Ratsikas, Georgios Kalantzis, Alexandros A. Voudouris
We study a discrete fair division problem where agents have additive valuation functions over a set of goods. We focus on the well-known -EFX fairness criterion, accord…
Distributed Agent-Constrained Truthful Facility Location
Argyrios Deligkas, Panagiotis Kanellopoulos, Alexandros A. Voudouris
We study a distributed facility location problem in which a set of agents, each with a private position on the real line, is partitioned into a collection of fixed, disjoint groups…
The Price of EF1 for Few Agents with Additive Ternary Valuations
Maria Kyropoulou, Alexandros A. Voudouris
We consider a resource allocation problem with agents that have additive ternary valuations for a set of indivisible items, and bound the price of envy-free up to one item (EF1) al…