Related papers: T-Theory Applications to Online Algorithms for the…
Two related online problems: knapsack and truthful bipartite matching are considered. For these two problems, the common theme is how to `match' an arriving left vertex in an online fashion with any of the available right vertices, if at…
The k-center problem is a fundamental problem we often face when considering complex service systems. Typical challenges include the placement of warehouses in logistics or positioning of servers for content delivery networks. We previously…
This paper has two results. The first is based on the surprising observation that the well-known ``least-recently-used'' paging algorithm and the ``balance'' algorithm for weighted caching are linear-programming primal-dual algorithms. This…
One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. Almost no computational tasks in real life are…
Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance…
Game theory is a powerful analytical tool for modeling decision makers strategies, behaviors and interactions. Act and decisions of a decision maker can benefit or negatively impact other decision makers interests. Game theory has been…
The weighted $k$-server problem is a natural generalization of the $k$-server problem in which the cost incurred in moving a server is the distance traveled times the weight of the server. Even after almost three decades since the seminal…
Design of {\it online algorithms} for assigning mobile users to basestations is considered with the objective of maximizing the sum-rate, when all users associated to any one basestation equally share each basestation's resources. Each user…
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
We consider the online $k$-taxi problem, a generalization of the $k$-server problem, in which $k$ servers are located in a metric space. A sequence of requests is revealed one by one, where each request is a pair of two points, representing…
Consider the continuous distributed monitoring model in which $n$ distributed nodes, receiving individual data streams, are connected to a designated server. The server is asked to continuously monitor a function defined over the values…
We study the problem of metrical service systems with multiple servers (MSSMS), which generalizes two well-known problems -- the $k$-server problem, and metrical service systems. The MSSMS problem is to service requests, each of which is an…
In this paper, we view the Internet under a game-theoretic lens in an effort to explain and overcome the Internet's innovation slump. Game Theory is used to model Internet environments as problems of technological competition toward the end…
Computers and algorithms play an ever-increasing role in obtaining new results in graph theory. In this survey, we present a broad range of techniques used in computer-assisted graph theory, including the exhaustive generation of all…
We identify fundamental issues with discretization when estimating information-theoretic quantities in the analysis of data. These difficulties are theoretical in nature and arise with discrete datasets carrying significant implications for…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
In this paper we consider online distributed learning problems. Online distributed learning refers to the process of training learning models on distributed data sources. In our setting a set of agents need to cooperatively train a learning…
Online computation is a concept to model uncertainty where not all information on a problem instance is known in advance. An online algorithm receives requests which reveal the instance piecewise and has to respond with irrevocable…
Electricity cost is a dominant and rapidly growing expense in data centers. Unfortunately, much of the consumed energy is wasted because servers are idle for extended periods of time. We study a capacity management problem that dynamically…
We consider online algorithms for the $k$-server problem on trees of size $n$. Chrobak and Larmore proposed a $k$-competitive algorithm for this problem that has the optimal competitive ratio. However, the existing implementations have…