Online service with delay
In this paper, we introduce the online service with delay problem. In this problem, there are n
points in a metric space that issue service requests over time, and a server that serves these …
points in a metric space that issue service requests over time, and a server that serves these …
The competition complexity of auctions: A bulow-klemperer result for multi-dimensional bidders
A seminal result of Bulow and Klemperer [1989] demonstrates the power of competition for
extracting revenue: when selling a single item to $ n $ bidders whose values are drawn iid …
extracting revenue: when selling a single item to $ n $ bidders whose values are drawn iid …
Settling the Competition Complexity of Additive Buyers over Independent Items
The competition complexity of an auction setting is the number of additional bidders needed
such that the simple mechanism of selling items separately (with additional bidders) …
such that the simple mechanism of selling items separately (with additional bidders) …
Reordering buffers with logarithmic diameter dependency for trees
In the reordering buffer problem a sequence of items located in a metric space arrive online,
and have to be processed by a single server moving within the metric space. At any point in …
and have to be processed by a single server moving within the metric space. At any point in …
Online service with delay
In this article, we introduce the online service with delay problem. In this problem, there are n
points in a metric space that issue service requests over time, and there is a server that …
points in a metric space that issue service requests over time, and there is a server that …
New approximations for reordering buffer management
In this paper we consider the buffer reordering management problem. In this model there are
n elements that arrive over time with different colors. There is a buffer that can store up to k …
n elements that arrive over time with different colors. There is a buffer that can store up to k …
Reordering buffer management with a logarithmic guarantee in general metric spaces
M Kohler, H Räcke - 44th International Colloquium on Automata …, 2017 - drops.dagstuhl.de
In the reordering buffer management problem a sequence of requests arrive online in a finite
metric space, and have to be processed by a single server. This server is equipped with a …
metric space, and have to be processed by a single server. This server is equipped with a …
Generalized reordering buffer management
An instance of the generalized reordering buffer management problem consists of a service
station that has k servers, each configured with a color, and a buffer of size b. The station …
station that has k servers, each configured with a color, and a buffer of size b. The station …
Polylogarithmic guarantees for generalized reordering buffer management
In the Generalized Reordering Buffer Management Problem (GRBM) a sequence of items
located in a metric space arrives online, and has to be processed by a set of k servers …
located in a metric space arrives online, and has to be processed by a set of k servers …
The reordering buffer problem on the line revisited
M Englert - ACM SIGACT News, 2018 - dl.acm.org
The reordering buffer problem (or also sorting buffer problem) was introduced by Räcke,
Sohler, and Westermann in 2002 [14] and has been extensively studied since then. In this …
Sohler, and Westermann in 2002 [14] and has been extensively studied since then. In this …