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 …

We study the mechanism design problem of a social planner for locating two facilities on a
line interval [0, 1], where a set of n strategic agents report their locations and a mechanism …

We introduce the domain of preferences that are single-peaked on a circle, which is a
generalization of the well-studied single-peaked domain. This preference restriction is …

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 study heterogeneous $ k $-facility location games. In this model there are $ k $ facilities
where each facility serves a different purpose. Thus, the preferences of the agents over the …

We study mechanism design with predictions for the obnoxious facility location problem. We
present deterministic strategyproof mechanisms that display tradeoffs between robustness …

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 …

The geometric median, an instrumental component of the secure machine learning toolbox,
is known to be effective when robustly aggregating models (or gradients), gathered from …

We revisit the discrete heterogeneous two-facility location problem, in which there is a set of
agents that occupy nodes of a line graph and have private approval preferences over two …

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 …