Mechanism Design With Predictions for Obnoxious Facility Location

12/19/2022
by   Gabriel Istrate, et al.
0

We study mechanism design with predictions for the obnoxious facility location problem. We present deterministic strategyproof mechanisms that display tradeoffs between robustness and consistency on segments, squares, circles and trees. All these mechanisms are actually group strategyproof, with the exception of the case of squares, where manipulations from coalitions of two agents exist. We prove that these tradeoffs are optimal in the 1-dimensional case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2022

Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location

In this work we introduce an alternative model for the design and analys...
research
05/23/2022

Mechanism Design with Predictions

Improving algorithms via predictions is a very active research topic in ...
research
08/20/2018

Group-Strategyproof mechanisms for facility location with Euclidean distance

We characterize the class of group-strategyproof mechanisms for single f...
research
05/06/2020

Heterogeneous Facility Location Games

We study heterogeneous k-facility location games. In this model there ar...
research
09/12/2021

The Obnoxious Facility Location Game with Dichotomous Preferences

We consider a facility location game in which n agents reside at known l...
research
02/04/2021

Strategyproof Facility Location Mechanisms on Discrete Trees

We address the problem of strategyproof (SP) facility location mechanism...
research
11/26/2020

Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in L_p Space

We consider the problem of locating a single facility for 2 agents in L_...

Please sign up or login with your details

Forgot password? Click here to reset