Two-facility Location Games with Minimum Distance Requirement
From MaRDI portal
Publication:5856478
DOI10.1613/jair.1.12319OpenAlexW3130513340MaRDI QIDQ5856478
Minming Li, Bo Li, Lingjie Duan, Xin Ping Xu
Publication date: 26 March 2021
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.12319
Related Items (11)
Two-facility location games with a minimum distance requirement on a circle ⋮ Discrete facility location games with different preferences ⋮ Minmax for facility location game with optional preference under minimum distance requirement ⋮ Heterogeneous facility location with limited resources ⋮ Two homogeneous facility location games with a minimum distance requirement on a circle ⋮ On Discrete Truthful Heterogeneous Two-Facility Location ⋮ Two-facility location games with distance requirement ⋮ Constrained heterogeneous two-facility location games with max-variant cost ⋮ Obnoxious facility location games with candidate locations ⋮ Constrained heterogeneous facility location games with max-variant cost ⋮ Facility reallocation on the line
Cites Work
- Unnamed Item
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategyproof mechanism design for facility location games with weighted agents on a line
- Strategy-proof location on a network
- Characterizing Mechanisms in Obnoxious Facility Game
- Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
- Location of Two Facilities with Minimal Separation
- Facility location games with optional preference
- Efficient Approximations for the Online Dispersion Problem
- Mechanisms for Obnoxious Facility Game on a Path
- On the Power of Deterministic Mechanisms for Facility Location Games
This page was built for publication: Two-facility Location Games with Minimum Distance Requirement
