
Reallocating Multiple Facilities on the Line
We study the multistage Kfacility reallocation problem on the real line...
read it

Mechanism Design for TwoOppositeFacility Location Games with Penalties on Distance
This paper is devoted to the twooppositefacility location games with a...
read it

Matching on the line admits no o(√(log n))competitive algorithm
We present a simple proof that the competitive ratio of any randomized o...
read it

Tight Competitive Analyses of Online Carsharing Problems
The carsharing problem, proposed by Luo, Erlebach and Xu in 2018, mainl...
read it

Performance Indicators Contributing To Success At The Group And PlayOff Stages Of The 2019 Rugby World Cup
Performance indicators that contributed to success at the group stage an...
read it

Online exploration outside a convex obstacle
A watchman route is a path such that a direct line of sight exists betwe...
read it

Online Search with Maximum Clearance
We study the setting in which a mobile agent must locate a hidden target...
read it
Facility Reallocation on the Line
We consider a multistage 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 stageperstage basis. We derive the optimal algorithm in both cases. For the online setting we show that its competitive ratio is (n+2)/(n+1). As neither of these algorithms turns out to yield a strategyproof mechanism, we propose another strategyproof mechanism which has a competitive ratio of (n+3)/(n+1) for odd n and (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.
READ FULL TEXT
Comments
There are no comments yet.