Constrained heterogeneous two-facility location games with sum-variant
From MaRDI portal
Publication:6571273
Recommendations
- Constrained heterogeneous two-facility location games with max-variant cost
- Constrained heterogeneous facility location games with max-variant cost
- Two-facility location games with minimum distance requirement
- Two-facility location games with distance requirement
- Mechanism design for two-opposite-facility location games with penalties on distance
Cites work
- Constrained heterogeneous facility location games with max-variant cost
- Facility location games with optional preference
- Heterogeneous facility location without money
- Multiple facility location games with envy ratio
- Obnoxious facility location games with candidate locations
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategy-proof location on a network
- Strategy-proof mechanism for obnoxious facility location on a line
- Strategyproof facility location with limited locations
- Strategyproof mechanism design for facility location games with weighted agents on a line
- Strategyproof mechanisms for \(2\)-facility location games with minimax envy
- Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
- Truthful two-facility location with candidate locations
- Two-facility location games with minimum distance requirement
Cited in
(3)
This page was built for publication: Constrained heterogeneous two-facility location games with sum-variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571273)
