Mechanism design for facility location problems: a survey
The study of approximate mechanism design for facility location problems has been in the
center of research at the intersection of artificial intelligence and economics for the last …
center of research at the intersection of artificial intelligence and economics for the last …
Learning-augmented mechanism design: Leveraging predictions for facility location
In this work we introduce an alternative model for the design and analysis of strategyproof
mechanisms that is motivated by the recent surge of work in" learning-augmented …
mechanisms that is motivated by the recent surge of work in" learning-augmented …
On voting and facility location
We study mechanisms for candidate selection that seek to minimize the social cost, where
voters and candidates are associated with points in some underlying metric space. The …
voters and candidates are associated with points in some underlying metric space. The …
On the power of deterministic mechanisms for facility location games
We consider K-Facility Location games, where n strategic agents report their locations in a
metric space and a mechanism maps them to K facilities. The agents seek to minimize their …
metric space and a mechanism maps them to K facilities. The agents seek to minimize their …
Approximate mechanism design for distributed facility location
A Filos-Ratsikas, AA Voudouris - … September 21–24, 2021, Proceedings 14, 2021 - Springer
We consider a single-facility location problem, where agents are positioned on the real line
and are partitioned into multiple disjoint districts. The goal is to choose a location (where a …
and are partitioned into multiple disjoint districts. The goal is to choose a location (where a …
[HTML][HTML] Heterogeneous facility location with limited resources
We initiate the study of the heterogeneous facility location problem with limited resources.
We mainly focus on the fundamental case where a set of agents are positioned in the line …
We mainly focus on the fundamental case where a set of agents are positioned in the line …
Settling the distortion of distributed facility location
A Filos-Ratsikas, P Kanellopoulos… - arxiv preprint arxiv …, 2023 - arxiv.org
We study the distributed facility location problem, where a set of agents with positions on the
line of real numbers are partitioned into disjoint districts, and the goal is to choose a point to …
line of real numbers are partitioned into disjoint districts, and the goal is to choose a point to …
Facility location with minimax envy
Q Cai, A Filos-Ratsikas, P Tang - 2016 - ora.ox.ac.uk
We study the problem of locating a public facility on a real line or an interval, when agents'
costs are their (expected) distances from the location of the facility. Our goal is to minimize …
costs are their (expected) distances from the location of the facility. Our goal is to minimize …
[PDF][PDF] Extended ranking mechanisms for the m-capacitated facility location problem in bayesian mechanism design
Mechanism Design seeks to establish protocols for aggregating the private information of a
set of agents to optimize a global objective. Nonetheless, optimizing a communal goal solely …
set of agents to optimize a global objective. Nonetheless, optimizing a communal goal solely …
Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio
In this paper, we study the two-facility location game on a line with optional preference
where the acceptable set of facilities for each agent could be different and an agent's cost is …
where the acceptable set of facilities for each agent could be different and an agent's cost is …