Two-facility location games with distance requirement
From MaRDI portal
Publication:6166871
DOI10.1007/978-3-031-20796-9_2zbMath1529.90049OpenAlexW4313349711MaRDI QIDQ6166871
Dandan Qian, Chen-Chen Wu, Ling Gai
Publication date: 3 August 2023
Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-20796-9_2
Cites Work
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategyproof mechanism design for facility location games with weighted agents on a line
- Two-facility location games with a minimum distance requirement on a circle
- Reallocating multiple facilities on the line
- Facility location games with distinct desires
- 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
- Two-facility Location Games with Minimum Distance Requirement
This page was built for publication: Two-facility location games with distance requirement