Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.16131 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916447965413376 |
|---|---|
| author | Kanellopoulos, Panagiotis Voudouris, Alexandros A. |
| author_facet | Kanellopoulos, Panagiotis Voudouris, Alexandros A. |
| contents | 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 that must be placed at locations chosen from a given set of candidate ones. Each agent wants to be as far away as possible from the facilities that affect her, and our goal is to design mechanisms that decide where to place the facilities so as to maximize the total happiness of the agents as well as provide the right incentives to them to truthfully report their positions. We consider separately the setting in which all agents are affected by both facilities (i.e., they have non-optional preferences) and the general optional setting. We show tight bounds on the approximation ratio of deterministic strategyproof mechanisms for both settings, and almost tight bounds for randomized mechanisms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_16131 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences Kanellopoulos, Panagiotis Voudouris, Alexandros A. Computer Science and Game Theory 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 that must be placed at locations chosen from a given set of candidate ones. Each agent wants to be as far away as possible from the facilities that affect her, and our goal is to design mechanisms that decide where to place the facilities so as to maximize the total happiness of the agents as well as provide the right incentives to them to truthfully report their positions. We consider separately the setting in which all agents are affected by both facilities (i.e., they have non-optional preferences) and the general optional setting. We show tight bounds on the approximation ratio of deterministic strategyproof mechanisms for both settings, and almost tight bounds for randomized mechanisms. |
| title | Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2410.16131 |