Strategy-proof mechanisms for obnoxious facility game with bounded service range

In this paper, we study the obnoxious facility game with a limited service capacity on a line network, in which all facilities are undesirable and necessary for agents, such as the garbage dumps. The limited service capacity restricts each facility only to serve the agents in its service radius $$r> 0$$ r > 0 . All agents prefer to be far away from facilities, but still to be served by a facility. Namely, the distance between an agent and her nearest facility is at most r. In a deterministic or randomized mechanism, based on the addresses reported by the selfish agents, the locations or the location distributions of facilities are determined. The aim of the mechanisms is to maximize the obnoxious social welfare, the total distance between all agents and the facilities, on the premise of each agent being served. On the other hand, each agent tries to maximize her own utility, i.e., the distance from the facility, and she may lie if, by doing so, to get strictly more benefit. We are interested in mechanisms without money to elicit the true location profile (strategy-proofness or group strategy-proofness) and maximize the obnoxious social welfare as much as possible. In this paper, we give the first attempt for this game on a closed interval [0, 1], to design group strategy-proof deterministic and randomized mechanisms for the case of $$\frac{1}{2}\le r\le 1$$ 1 2 ≤ r ≤ 1 . The approximation ratios, depending on the radius r, of different mechanisms are explored. We also provide the lower bounds on approximation ratios of deterministic strategy-proof mechanisms.