Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance

  title={Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance},
  author={Xujin Chen and Xiaodong Hu and Xiaohua Jia and Minming Li and Zhongzheng Tang and Chenhao Wang},
This paper is devoted to the two-opposite-facility location games with a penalty whose amount depends on the distance between the two facilities to be opened by an authority. The two facilities are “opposite” in that one is popular and the other is obnoxious. Every selfish agent in the game wishes to stay close to the popular facility and stay away from the obnoxious one; its utility is measured by the difference between its distances to the obnoxious facility and the popular one. The authority… 
Truthful Mechanisms for Location Games of Dual-Role Facilities
An optimal truthful mechanism without regard to time complexity is given for the minimum social-cost objective, and a small gap is shown between the best known approximation ratio of polynomial-time truthful mechanisms for the game and that of polymouth-time approximation algorithms for the counterpart of pure optimization.
Mechanism Design for Facility Location Games with Candidate Locations
This work studies the facility location games with candidate locations from a mechanism design perspective, and gives a deterministic 3-approximation group strategy-proof mechanism, and proves that no deterministic (or randomized) strategy-Proof mechanism can have an approximation ratio better than 3.
Facility Location with Entrance Fees
In mechanism design, the facility location game is an extensively studied problem. In the classical model, the cost of each agent is her distance to the nearest facility. In this paper, we consider a
Facility Location Games with Ordinal Preferences
The goal is to design strategyproof mechanisms that elicit truthful information (preferences and/or locations) from the agents and locate the facilities to minimize both maximum and total cost objectives as well as to maximize both minimum and total utility objectives.
Budgeted Facility Location Games with Strategic Facilities
Under a given budget B, which constrains the total payment, upper and lower bounds on the approximation ratios of truthful budget feasible mechanisms for four utilitarian and egalitarian objectives are derived.
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio
A deterministic strategyproof mechanism for the two-facility location game on a line with optional preference is designed with approximation ratio of 2.75, improving upon the earlier best ratio of n/2+1.
Mechanism Design in Facility Location Games
This thesis studies three different kinds of facility location games, and designs truthful mechanisms with good performances, which will offer new insight on extending the classic facility locationgames.
Mechanism Design for Facility Location Problems: A Survey
A comprehensive survey of the significant progress that has been made since the introduction of the approximate mechanism design problem is presented, highlighting the different variants and methodologies, as well as the most interesting directions for future research.
Strategyproof Facility Location with Limited Locations


Strategy-Proof Mechanisms for Facility Location Games with Many Facilities
This paper designs strategyproof mechanisms to locate n - 1 facilities for n agents and provides lower and upper bounds on the approximation ratio of deterministic and randomized strategy-proof mechanisms.
Asymptotically optimal strategy-proof mechanisms for two-facility games
This paper proves an Ω(n) lower bound of the social cost approximation ratio for deterministic strategy-proof mechanisms and provides the first randomized strategy-Proof mechanism with a constant approximation ratio of 4.1 and works in general metric spaces.
Facility Location Games With Fractional Preferences
In this paper, we propose a fractional preference model for the facility location game with two facilities that serve the similar purpose on a line where each agent has his location information
On the Power of Deterministic Mechanisms for Facility Location Games
It is shown that for every K ≥ 3, there do not exist any deterministic anonymous strategyproof mechanisms with a bounded approximation ratio for K-Facility Location on the line, even for simple instances with K+1 agents.
Strategy-proof approximation mechanisms for an obnoxious facility game on networks
Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models
The goal is to maximize a form of aggregated social benefit: maxisum- the sum of the agents' utilities, or the egalitarian objective- the minimal agent utility, and to design strategyproof mechanisms with good approximation ratios.
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs
It is shown that the median mechanism provides a 21−1/p approximation ratio, and that this is the optimal approximation ratio among all deterministic strategyproof mechanisms.
Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
Deterministic and randomized strategy-proof mechanisms w.r.t. maxSum and maxSOS objectives are investigated and the deterministic mechanisms are shown to be tight for both objectives.
Strategyproof facility location and the least squares objective
A general and clean family of strategyproof (SP) mechanisms for facility location on tree networks is introduced, for the first time, and all of the deterministic and randomized SP mechanisms that have been previously proposed can be cast as special cases of this family.
Facility location with double-peaked preferences
It is proved that among a large class of reasonable strategyproof mechanisms, there is no deterministic mechanism that outperforms the authors' truthful-in-expectation mechanism.