Mechanism design for one-facility location game with obnoxious effects on a line
From MaRDI portal
Publication:2636498
Recommendations
- Mechanism Design for One-Facility Location Game with Obnoxious Effects
- Approximation strategy-proof mechanisms for obnoxious facility location on a line
- Strategy-proof mechanisms for obnoxious facility game with bounded service range
- Mechanisms for obnoxious facility game on a path
- Strategy-proof mechanism for obnoxious facility location on a line
Cites work
- Characterizing mechanisms in obnoxious facility game
- Mechanisms for obnoxious facility game on a path
- Obnoxious facility game with a bounded service range
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- Strategy-proof mechanism for obnoxious facility location on a line
- Strategy-proof mechanisms for facility location games with many facilities
- Strategyproof approximation of the minimax on networks
- Strategyproof mechanism design for facility location games with weighted agents on a line
Cited in
(5)- Mechanism design for two-opposite-facility location games with penalties on distance
- Approximation strategy-proof mechanisms for obnoxious facility location on a line
- Two-facility location games with a minimum distance requirement on a circle
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
- Facility location games with distinct desires
This page was built for publication: Mechanism design for one-facility location game with obnoxious effects on a line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636498)
