In this paper, we study the two-facility location game on a line with optional preference where the acceptable set of facilities for each agent could be different and an agents cost is his distance to the closest facility within his acceptable set. The objective is to minimize the total cost of all agents while achieving strategyproofness. We design a deterministic strategyproof mechanism for the problem with approximation ratio of 2.75, improving upon the earlier best ratio of n/2+1.
تحميل البحث