Mechanism Design for One-Facility Location Game with Obnoxious Effects
From MaRDI portal
Publication:4632182
DOI10.1007/978-3-319-39817-4_17zbMath1479.91070OpenAlexW2506960859MaRDI QIDQ4632182
Lili Mei, Deshi Ye, Guo-Chuan Zhang
Publication date: 26 April 2019
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_17
Applications of game theory (91A80) Discrete location and assignment (90B80) Mechanism design theory (91B03)
Cites Work
- Strategyproof mechanism design for facility location games with weighted agents on a line
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- Strategy-Proof Mechanisms for Facility Location Games with Many Facilities
- Characterizing Mechanisms in Obnoxious Facility Game
- Strategyproof Approximation of the Minimax on Networks
- Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
- On locating a semi-desirable facility on the continuous plane
- Obnoxious Facility Game with a Bounded Service Range
- Mechanisms for Obnoxious Facility Game on a Path
This page was built for publication: Mechanism Design for One-Facility Location Game with Obnoxious Effects