Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

DOI10.1007/978-3-319-30139-6_23zbMath1478.91053OpenAlexW2472378552MaRDI QIDQ2803833

Hiroshi Nagamochi, Morito Oomine, Aleksandar Shurbevski

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

zbMATH Keywords

optimizationstrategy-proofmechanism designanonymousfacility game

Mathematics Subject Classification ID

Applications of game theory (91A80) Discrete location and assignment (90B80) Social choice (91B14) Mechanism design theory (91B03)

Related Items (1)

The obnoxious facility location game with dichotomous preferences

Cites Work

• Strategy-proof location on a network
• Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
• Characterizing Mechanisms in Obnoxious Facility Game
• Strategyproof Approximation of the Minimax on Networks
• Straightforward Elections, Unanimity and Phantom Voters
• Obnoxious Facility Game with a Bounded Service Range
• Mechanisms for Obnoxious Facility Game on a Path

This page was built for publication: Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game