Parameterization of strategy-proof mechanisms in the obnoxious facility game
From MaRDI portal
Publication:2803833
DOI10.1007/978-3-319-30139-6_23zbMATH Open1478.91053OpenAlexW2472378552MaRDI QIDQ2803833FDOQ2803833
Authors: Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi 
Publication date: 3 May 2016
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_23
Recommendations
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
- Characterizing mechanisms in obnoxious facility game
- Mechanisms for obnoxious facility game on a path
- Strategy-proof mechanisms for obnoxious facility game with bounded service range
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
Social choice (91B14) Applications of game theory (91A80) Discrete location and assignment (90B80) Mechanism design theory (91B03)
Cites Work
- Strategyproof approximation of the minimax on networks
- Strategy-proof location on a network
- Straightforward Elections, Unanimity and Phantom Voters
- Mechanisms for obnoxious facility game on a path
- Characterizing mechanisms in obnoxious facility game
- Obnoxious facility game with a bounded service range
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
Cited In (3)
This page was built for publication: Parameterization of strategy-proof mechanisms in the obnoxious facility game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803833)
