Facility Reallocation on the Line

Abstract

We consider a multi-stage facility reallocation problems on the real line, where a facility is being moved between time stages based on the locations reported by n agents. The aim of the reallocation algorithm is to minimise the social cost, i.e., the sum over the total distance between the facility and all agents at all stages, plus the cost incurred for moving the facility. We study this problem both in the offline setting and online setting. In the offline case the algorithm has full knowledge of the agent locations in all future stages, and in the online setting the algorithm does not know these future locations and must decide the location of the facility on a stage-per-stage basis. We derive the optimal algorithm in both cases. For the online setting we show that its competitive ratio is $$(n+2)/(n+1)$$ ( n + 2 ) / ( n + 1 ) . As neither of these algorithms turns out to yield a strategy-proof mechanism, we propose another strategy-proof mechanism which has a competitive ratio of $$(n+3)/(n+1)$$ ( n + 3 ) / ( n + 1 ) for odd n and $$(n+4)/n$$ ( n + 4 ) / n for even n, which we conjecture to be the best possible. We also consider a generalisation with multiple facilities and weighted agents, for which we show that the optimum can be computed in polynomial time for a fixed number of facilities.

Toward Online Mobile Facility Location on General Metrics

“…The last inequality follows from (11), (12), and (16). As the sum of the service cost improvements has to be at least η p , we obtain = d(F m−1 , F * ) ≥ η p /γ (m) as claimed.…”

“…As defined in Section 1.2.1, σ v,t (x) is the service cost at node v of having x facilities at time t. (11) identifies a set of points where removing a facility causes the least increase in service cost. (12) identifies a set of points where adding a facility causes the most decrease in service cost. DGA then moves a facility from a point in the first set to a point in the second set.…”