On Truthful Constrained Facility Location with Max-Variant Cost

09/11/2023
by   Mohammad Lotfi, et al.
0

We consider a problem where agents are positioned on a line, have approval preferences over two facilities, and their cost is the maximum distance from their approved facilities. The goal is to decide the facility locations to minimize the total and the max cost, while incentivizing the agents to be truthful. We show that a simple strategyproof mechanism is 7-approximate for the total cost and 5-approximate for the max cost, thus improving upon the previous bounds of 2n+1 and 9.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2023

Truthful Two-Facility Location with Candidate Locations

We study a truthful two-facility location problem in which a set of agen...
research
09/09/2021

On Discrete Truthful Heterogeneous Two-Facility Location

We revisit the discrete heterogeneous two-facility location problem, in ...
research
12/18/2017

No truthful mechanism can be better than n approximate for two natural problems

This work gives the first natural non-utilitarian problems for which the...
research
11/22/2019

Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives

We consider the facility location problem in the one-dimensional setting...
research
06/25/2020

Cost Sharing Security Information with Minimal Release Delay

We study a cost sharing problem derived from bug bounty programs, where ...
research
03/23/2021

Facility Reallocation on the Line

We consider a multi-stage facility reallocation problems on the real lin...
research
12/07/2022

Optimizing Multiple Simultaneous Objectives for Voting and Facility Location

We study the classic facility location setting, where we are given n cli...

Please sign up or login with your details

Forgot password? Click here to reset