Two-facility location games with distance requirement
From MaRDI portal
Publication:6166871
DOI10.1007/978-3-031-20796-9_2zbMATH Open1529.90049OpenAlexW4313349711MaRDI QIDQ6166871FDOQ6166871
Authors: Ling Gai, Dandan Qian, Chenchen Wu 
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
Recommendations
- Two-facility location games with minimum distance requirement
- Mechanism design for two-opposite-facility location games with penalties on distance
- Minmax for facility location game with optional preference under minimum distance requirement
- Constrained heterogeneous two-facility location games with sum-variant
- Strategy-proof mechanisms for facility location games with many facilities
Cites Work
- On the power of deterministic mechanisms for facility location games
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Reallocating multiple facilities on the line
- Strategyproof mechanism design for facility location games with weighted agents on a line
- Mechanisms for obnoxious facility game on a path
- Efficient Approximations for the Online Dispersion Problem
- Facility location games with distinct desires
- Two-facility location games with minimum distance requirement
- Two-facility location games with a minimum distance requirement on a circle
Cited In (5)
- Constrained heterogeneous two-facility location games with sum-variant
- Minmax for facility location game with optional preference under minimum distance requirement
- Two-facility location games with a minimum distance requirement on a circle
- A Class of Location Games with Type Dependent Facilities
- Two-facility-location games with mixed types of agents
This page was built for publication: Two-facility location games with distance requirement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166871)
