Truthful two-facility location with candidate locations
From MaRDI portal
Publication:6546305
Recommendations
Cites work
- Approximate mechanism design for distributed facility location
- Constrained heterogeneous facility location games with max-variant cost
- Heterogeneous facility location with limited resources
- Heterogeneous facility location without money
- Mechanism design for facility location games with candidate locations
- Mechanism design for facility location with fractional preferences and minimum distance
- Obnoxious facility location games with candidate locations
- On Discrete Truthful Heterogeneous Two-Facility Location
- Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategyproof approximation of the minimax on networks
- Strategyproof facility location for concave cost functions
- Strategyproof facility location for three agents on a circle
- Two-facility location games with minimum distance requirement
Cited in
(7)- Mechanisms for dual-role-facility location games: truthfulness and approximability
- Strategyproof facility location with limited locations
- On truthful constrained heterogeneous facility location with max-variant cost
- Constrained heterogeneous two-facility location games with sum-variant
- Truthful two-facility location with candidate locations
- Facility location game for maximizing the social satisfaction on a line
- Agent-constrained truthful facility location games
This page was built for publication: Truthful two-facility location with candidate locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546305)
