activity
20142026
most citedFair Division of Indivisible Goods: Recent Progress and Open Questions

93 citations · 279 across the 45 of their papers we have counts for

collaborators
Showing cs.GTShow all

57 papers · 1 filter

cs.GT2026

Truthful Two-Facility Location with Candidate Locations in Metric Spaces

Panagiotis Kanellopoulos, Alexandros A. Voudouris

We study a truthful facility location problem in which agents have private positions in a metric space and known approval preferences over two distinct facilities. Each agent incur…

cs.GT2026

Optimal Rank Lotteries for Truthful Unit-Interval Covering

Alexandros A. Voudouris

In truthful interval covering, each agent has a private interval of unit length, and the goal is to decide where to place a public unit interval so as to minimize the total uncover…

cs.GT2026

Group-Fair Metric Distortion of Facility Assignment Problems

Alexandros A. Voudouris

We study the group-fair distortion of metric facility assignment problems, where a set of agents, partitioned into unknown groups, must be assigned to a collection of facilities, p…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2026

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, accordi…

cs.GT2026

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…

cs.GT2025

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…

cs.GT2025

Variety-Seeking Jump Games on Graphs

Lata Narayanan, Jaroslav Opatrny, Shanmukha Tummala +1

We consider a class of jump games in which agents of different types occupy the nodes of a graph aiming to maximize the variety of types in their neighborhood. In particular, each…

cs.GT2025

Truthful Facility Location with Candidate Locations and Limited Resources

Panagiotis Kanellopoulos, Alexandros A. Voudouris

We study a truthful facility location problem where one out of available facilities must be built at a location chosen from a set of candidate ones in the interval …

cs.GT2025

Utilitarian Distortion with Predictions

Aris Filos-Ratsikas, Georgios Kalantzis, Alexandros A. Voudouris

We study the utilitarian distortion of social choice mechanisms under the recently proposed learning-augmented framework where some (possibly unreliable) predicted information abou…

cs.GT2025

Optimal Metric Distortion for Matching on the Line

Aris Filos-Ratsikas, Vasilis Gkatzelis, Mohamad Latifian +2

We study the distortion of one-sided and two-sided matching problems on the line. In the one-sided case, agents need to be matched to items, and each agent's cost in a matc…

cs.GT2024

Metric Distortion of Obnoxious Distributed Voting

Alexandros A. Voudouris

We consider a distributed voting problem with a set of agents that are partitioned into disjoint groups and a set of obnoxious alternatives. Agents and alternatives are represented…

cs.GT2024

Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences

Panagiotis Kanellopoulos, Alexandros A. Voudouris

We consider a truthful facility location problem with agents that have private positions on the line of real numbers and known optional preferences over two obnoxious facilities th…

cs.GT2024

Agent-Constrained Truthful Facility Location Games

Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris

We consider a truthful facility location problem in which there is a set of agents with private locations on the line of real numbers, and the goal is to place a number of faciliti…

cs.GT2024

Metric Distortion under Group-Fair Objectives

Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett +1

We consider a voting problem in which a set of agents have metric preferences over a set of alternatives, and are also partitioned into disjoint groups. Given information about the…

cs.GT2024

The Distortion of Threshold Approval Matching

Mohamad Latifian, Alexandros A. Voudouris

We study matching settings in which a set of agents have private utilities over a set of items. Each agent reports a partition of the items into approval sets of different threshol…

cs.GT2023

On Truthful Constrained Heterogeneous Facility Location with Max-Variant Cost

Mohammad Lotfi, Alexandros A. Voudouris

We consider a problem where agents have private positions on a line, and public approval preferences over two facilities, and their cost is the maximum distance from their approved…

cs.GT2023

Truthful Interval Covering

Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris

We initiate the study of a novel problem in mechanism design without money, which we term Truthful Interval Covering (TIC). An instance of TIC consists of a set of agents each asso…

cs.GT2023★ 1 cited

Improved Metric Distortion via Threshold Approvals

Elliot Anshelevich, Aris Filos-Ratsikas, Christopher Jerrett +1

We consider a social choice setting in which agents and alternatives are represented by points in a metric space, and the cost of an agent for an alternative is the distance betwee…

cs.GT2023★ 2 cited

Diversity-seeking Jump Games in Networks

Lata Narayanan, Yasaman Sabbagh, Alexandros A. Voudouris

Recently, strategic games inspired by Schelling's influential model of residential segregation have been studied in the TCS and AI literature. In these games, agents of k different…

cs.GT2023★ 1 cited

Truthful Two-Facility Location with Candidate Locations

Panagiotis Kanellopoulos, Alexandros A. Voudouris, Rongsen Zhang

We study a truthful two-facility location problem in which a set of agents have private positions on the line of real numbers and known approval preferences over two different faci…

cs.GT2023

Revisiting the Distortion of Distributed Voting

Aris Filos-Ratsikas, Alexandros A. Voudouris

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a m…