The obnoxious facility location game with dichotomous preferences

DOI10.1016/j.tcs.2023.113930arXiv2109.05396OpenAlexW3201309118MaRDI QIDQ6039896

Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha

Publication date: 23 May 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.05396

zbMATH Keywords

game theoryfacility locationmechanism design

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Heterogeneous facility location without money
• Strategy-proof approximation mechanisms for an obnoxious facility game on networks
• Strategyproof mechanism design for facility location games with weighted agents on a line
• Weighted approval voting
• Facility location games with optional preference
• Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
• Computing largest empty circles with location constraints
• Characterizing Mechanisms in Obnoxious Facility Game
• Strategyproof Approximation of the Minimax on Networks
• Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
• Facility location games with optional preference
• Obnoxious Facility Game with a Bounded Service Range
• Mechanisms for Obnoxious Facility Game on a Path

This page was built for publication: The obnoxious facility location game with dichotomous preferences