Obnoxious Facility Location Games with Candidate Locations

Abstract

AbstractWe study obnoxious facility location games with facility candidate locations. For obnoxious single facility location games under social utility objective, we present a group strategy-proof mechanism with approximation ratio of 3. Then we prove the ratio is tight by giving a corresponding lower bound instance. This is also proved to be the best possible mechanism. For obnoxious two-facility location games with facility candidate locations, we study the heterogeneous facility case in this paper. We design a group strategy-proof mechanism and prove that the approximation ratio is 2. We also prove that the problem lower bound is \(\frac{3}{2}\). KeywordsObnoxious facility location gameMechanism designStrategyproofApproximation ratio