Metrical Service Systems with Transformations

09/17/2020
by   Sébastien Bubeck, et al.
0

We consider a generalization of the fundamental online metrical service systems (MSS) problem where the feasible region can be transformed between requests. In this problem, which we call T-MSS, an algorithm maintains a point in a metric space and has to serve a sequence of requests. Each request is a map (transformation) f_t A_t→ B_t between subsets A_t and B_t of the metric space. To serve it, the algorithm has to go to a point a_t∈ A_t, paying the distance from its previous position. Then, the transformation is applied, modifying the algorithm's state to f_t(a_t). Such transformations can model, e.g., changes to the environment that are outside of an algorithm's control, and we therefore do not charge any additional cost to the algorithm when the transformation is applied. The transformations also allow to model requests occurring in the k-taxi problem. We show that for α-Lipschitz transformations, the competitive ratio is Θ(α)^n-2 on n-point metrics. Here, the upper bound is achieved by a deterministic algorithm and the lower bound holds even for randomized algorithms. For the k-taxi problem, we prove a competitive ratio of Õ((nlog k)^2). For chasing convex bodies, we show that even with contracting transformations no competitive algorithm exists. The problem T-MSS has a striking connection to the following deep mathematical question: Given a finite metric space M, what is the required cardinality of an extension M̂⊇ M where each partial isometry on M extends to an automorphism? We give partial answers for special cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2018

The Online k-Taxi Problem

We consider the online k-taxi problem, a generalization of the k-server ...
research
05/17/2020

The Online Multi-Commodity Facility Location Problem

We consider a natural extension to the metric uncapacitated Facility Loc...
research
05/28/2019

Chasing Convex Bodies Optimally

In the chasing convex bodies problem, an online player receives a reques...
research
03/07/2022

Online Matching with Convex Delay Costs

We investigate the problem of Min-cost Perfect Matching with Delays (MPM...
research
09/14/2021

Online k-Way Matching with Delays and the H-Metric

In this paper, we study k-Way Min-cost Perfect Matching with Delays - th...
research
11/21/2021

Multiscale entropic regularization for MTS on general metric spaces

We present an O((log n)^2)-competitive algorithm for metrical task syste...
research
04/13/2023

List Update with Delays or Time Windows

We consider the problem of List Update, one of the most fundamental prob...

Please sign up or login with your details

Forgot password? Click here to reset