Facility location games with distinct desires
From MaRDI portal
Publication:2422745
DOI10.1016/j.dam.2019.02.017zbMath1422.91153OpenAlexW2921610810MaRDI QIDQ2422745
Deshi Ye, Minming Li, Lili Mei, Guo-Chuan Zhang
Publication date: 20 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.017
Games involving graphs (91A43) Applications of game theory (91A80) Discrete location and assignment (90B80)
Related Items (9)
Two-facility location games with a minimum distance requirement on a circle ⋮ Strategyproof mechanisms for \(2\)-facility location games with minimax envy ⋮ Strategy-proof mechanisms for obnoxious facility game with bounded service range ⋮ Two-facility location games with distance requirement ⋮ Constrained heterogeneous two-facility location games with max-variant cost ⋮ Constrained heterogeneous facility location games with max-variant cost ⋮ Strategyproof mechanisms for 2-facility location games with minimax envy ⋮ Multiple facility location games with envy ratio ⋮ Multiple facility location games with envy ratio
Cites Work
- Unnamed Item
- Strategyproof facility location for concave cost functions
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategy-proof location on a network
- Strategy-Proof Mechanisms for Facility Location Games with Many Facilities
- Characterizing Mechanisms in Obnoxious Facility Game
- Strategyproof Approximation of the Minimax on Networks
- Facility location games with optional preference
- Mechanisms for Obnoxious Facility Game on a Path
- On the Power of Deterministic Mechanisms for Facility Location Games
This page was built for publication: Facility location games with distinct desires
