Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
From MaRDI portal
Publication:3196371
DOI10.1007/978-3-319-21398-9_4zbMath1468.90070OpenAlexW1181144414MaRDI QIDQ3196371
Lili Mei, Deshi Ye, Yong Zhang
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_4
Related Items (7)
Mechanism design for one-facility location game with obnoxious effects on a line ⋮ An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space ⋮ The obnoxious facility location game with dichotomous preferences ⋮ Strategyproof facility location with limited locations ⋮ Mechanism design for facility location with fractional preferences and minimum distance ⋮ Facility location games with optional preference ⋮ Mechanism Design for One-Facility Location Game with Obnoxious Effects
Cites Work
- Unnamed Item
- Strategyproof facility location for concave cost functions
- Strategy-proof location on a network
- Analytical models for locating undesirable facilities
- A note on the location of an obnoxious facility on a network
- Location analysis: a synthesis and survey
- Approximately optimal mechanism design via differential privacy
- Characterizing Mechanisms in Obnoxious Facility Game
- Strategyproof Approximation of the Minimax on Networks
- Obnoxious Facility Location on Graphs
- Manipulation of Voting Schemes: A General Result
- On the Power of Deterministic Mechanisms for Facility Location Games
This page was built for publication: Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
