Reallocating Multiple Facilities on the Line

by   Dimitris Fotakis, et al.

We study the multistage K-facility reallocation problem on the real line, where we maintain K facility locations over T stages, based on the stage-dependent locations of n agents. Each agent is connected to the nearest facility at each stage, and the facilities may move from one stage to another, to accommodate different agent locations. The objective is to minimize the connection cost of the agents plus the total moving cost of the facilities, over all stages. K-facility reallocation was introduced by de Keijzer and Wojtczak, where they mostly focused on the special case of a single facility. Using an LP-based approach, we present a polynomial time algorithm that computes the optimal solution for any number of facilities. We also consider online K-facility reallocation, where the algorithm becomes aware of agent locations in a stage-by-stage fashion. By exploiting an interesting connection to the classical K-server problem, we present a constant-competitive algorithm for K = 2 facilities.


page 1

page 2

page 3

page 4


Facility Reallocation on the Line

We consider a multi-stage facility reallocation problems on the real lin...

Maximin-Aware Allocations of Indivisible Goods

We study envy-free allocations of indivisible goods to agents in setting...

Strategyproof Facility Location in Perturbation Stable Instances

We consider k-Facility Location games, where n strategic agents report t...

Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives

We consider the facility location problem in the one-dimensional setting...

Performance Indicators Contributing To Success At The Group And Play-Off Stages Of The 2019 Rugby World Cup

Performance indicators that contributed to success at the group stage an...

Mobility Data in Operations: The Facility Location Problem

The recent large scale availability of mobility data, which captures ind...

House-Swapping with Objective Indifferences

We study the classic house-swapping problem of Shapley and Scarf (1974) ...

Please sign up or login with your details

Forgot password? Click here to reset