4,089 research outputs found
Metrical Service Systems with Multiple Servers
We study the problem of metrical service systems with multiple servers
(MSSMS), which generalizes two well-known problems -- the -server problem,
and metrical service systems. The MSSMS problem is to service requests, each of
which is an -point subset of a metric space, using servers, with the
objective of minimizing the total distance traveled by the servers.
Feuerstein initiated a study of this problem by proving upper and lower
bounds on the deterministic competitive ratio for uniform metric spaces. We
improve Feuerstein's analysis of the upper bound and prove that his algorithm
achieves a competitive ratio of . In the randomized
online setting, for uniform metric spaces, we give an algorithm which achieves
a competitive ratio , beating the deterministic lower
bound of . We prove that any randomized algorithm for
MSSMS on uniform metric spaces must be -competitive. We then
prove an improved lower bound of on
the competitive ratio of any deterministic algorithm for -MSSMS, on
general metric spaces. In the offline setting, we give a pseudo-approximation
algorithm for -MSSMS on general metric spaces, which achieves an
approximation ratio of using servers. We also prove a matching
hardness result, that a pseudo-approximation with less than servers is
unlikely, even for uniform metric spaces. For general metric spaces, we
highlight the limitations of a few popular techniques, that have been used in
algorithm design for the -server problem and metrical service systems.Comment: 18 pages; accepted for publication at COCOON 201
Changing Bases: Multistage Optimization for Matroids and Matchings
This paper is motivated by the fact that many systems need to be maintained
continually while the underlying costs change over time. The challenge is to
continually maintain near-optimal solutions to the underlying optimization
problems, without creating too much churn in the solution itself. We model this
as a multistage combinatorial optimization problem where the input is a
sequence of cost functions (one for each time step); while we can change the
solution from step to step, we incur an additional cost for every such change.
We study the multistage matroid maintenance problem, where we need to maintain
a base of a matroid in each time step under the changing cost functions and
acquisition costs for adding new elements. The online version of this problem
generalizes online paging. E.g., given a graph, we need to maintain a spanning
tree at each step: we pay for the cost of the tree at time
, and also for the number of edges changed at
this step. Our main result is an -approximation, where is
the number of elements/edges and is the rank of the matroid. We also give
an approximation for the offline version of the problem. These
bounds hold when the acquisition costs are non-uniform, in which caseboth these
results are the best possible unless P=NP.
We also study the perfect matching version of the problem, where we must
maintain a perfect matching at each step under changing cost functions and
costs for adding new elements. Surprisingly, the hardness drastically
increases: for any constant , there is no
-approximation to the multistage matching maintenance
problem, even in the offline case
Randomized online computation with high probability guarantees
We study the relationship between the competitive ratio and the tail
distribution of randomized online minimization problems. To this end, we define
a broad class of online problems that includes some of the well-studied
problems like paging, k-server and metrical task systems on finite metrics, and
show that for these problems it is possible to obtain, given an algorithm with
constant expected competitive ratio, another algorithm that achieves the same
solution quality up to an arbitrarily small constant error a with high
probability; the "high probability" statement is in terms of the optimal cost.
Furthermore, we show that our assumptions are tight in the sense that removing
any of them allows for a counterexample to the theorem. In addition, there are
examples of other problems not covered by our definition, where similar high
probability results can be obtained.Comment: 20 pages, 2 figure
Invisible control of self-organizing agents leaving unknown environments
In this paper we are concerned with multiscale modeling, control, and
simulation of self-organizing agents leaving an unknown area under limited
visibility, with special emphasis on crowds. We first introduce a new
microscopic model characterized by an exploration phase and an evacuation
phase. The main ingredients of the model are an alignment term, accounting for
the herding effect typical of uncertain behavior, and a random walk, accounting
for the need to explore the environment under limited visibility. We consider
both metrical and topological interactions. Moreover, a few special agents, the
leaders, not recognized as such by the crowd, are "hidden" in the crowd with a
special controlled dynamics. Next, relying on a Boltzmann approach, we derive a
mesoscopic model for a continuum density of followers, coupled with a
microscopic description for the leaders' dynamics. Finally, optimal control of
the crowd is studied. It is assumed that leaders exploit the herding effect in
order to steer the crowd towards the exits and reduce clogging. Locally-optimal
behavior of leaders is computed. Numerical simulations show the efficiency of
the optimization methods in both microscopic and mesoscopic settings. We also
perform a real experiment with people to study the feasibility of the proposed
bottom-up crowd control technique.Comment: in SIAM J. Appl. Math, 201
The generalized work function algorithm is competitive for the generalized 2-server problem
The generalized 2-server problem is an online optimization problem where a
sequence of requests has to be served at minimal cost. Requests arrive one by
one and need to be served instantly by at least one of two servers. We consider
the general model where the cost function of the two servers may be different.
Formally, each server moves in its own metric space and a request consists of
one point in each metric space. It is served by moving one of the two servers
to its request point. Requests have to be served without knowledge of the
future requests. The objective is to minimize the total traveled distance. The
special case where both servers move on the real line is known as the
CNN-problem. We show that the generalized work function algorithm is constant
competitive for the generalized 2-server problem
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
The generalized 2-server problem is an online optimization problem where a sequence of requests has to be served at minimal cost. Requests arrive one by one and need to be served instantly by at least one of two servers. We consider the general model where the cost function of the two servers may be different. Formally, each server moves in its own metric space and a request consists of one point in each metric space. It is served by moving one of the two servers to its request point. Requests have to be served without knowledge of future requests. The objective is to minimize the total traveled distance. The special case where both servers move on the real line is known as the CNN problem. We show that the generalized work function algorithm, , is constant competitive for the generalized 2-server problem. Further, we give an outline for a possible extension to servers and discuss the applicability of our techniques and of the work function algorithm in general. We conclude with a discussion on several open problems in online optimization
Weighted k-Server Bounds via Combinatorial Dichotomies
The weighted -server problem is a natural generalization of the -server
problem where each server has a different weight. We consider the problem on
uniform metrics, which corresponds to a natural generalization of paging. Our
main result is a doubly exponential lower bound on the competitive ratio of any
deterministic online algorithm, that essentially matches the known upper bounds
for the problem and closes a large and long-standing gap.
The lower bound is based on relating the weighted -server problem to a
certain combinatorial problem and proving a Ramsey-theoretic lower bound for
it. This combinatorial connection also reveals several structural properties of
low cost feasible solutions to serve a sequence of requests. We use this to
show that the generalized Work Function Algorithm achieves an almost optimum
competitive ratio, and to obtain new refined upper bounds on the competitive
ratio for the case of different weight classes.Comment: accepted to FOCS'1
- …