Two-facility location games with distance requirement
From MaRDI portal
Publication:6166871
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
- Efficient approximations for the online dispersion problem
- Facility location games with distinct desires
- Mechanisms for obnoxious facility game on a path
- On the power of deterministic mechanisms for facility location games
- Reallocating multiple facilities on the line
- 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
- Two-facility location games with minimum distance requirement
Cited in
(5)- Two-facility location games with a minimum distance requirement on a circle
- A Class of Location Games with Type Dependent Facilities
- 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 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)
