![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Improved Approximation Algorithms for Budgeted Allocations
We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e − 1) approximation of Andelman and Mansour [1...
-
Chapter and Conference Paper
Ad Auctions – Current and Future Research
An exploding market has emerged during the last few years on the internet, the market of sponsored search slots. Advertisers are able to buy space on the webpages produced by popular search engines and place a...
-
Chapter and Conference Paper
Mechanism Design for Fun and Profit
The emergence of the Internet as one of the most important arenas for resource sharing between parties with diverse and selfish interests has led to a number of fascinating and new algorithmic problems. In the...
-
Chapter and Conference Paper
Truthful and Competitive Double Auctions
In this paper we consider the problem of designing a mechanism for double auctions where bidders each bid to buy or sell one unit of a single commodity. We assume that each bidder’s utility value for the item ...
-
Chapter and Conference Paper
An Experimental Study of Data Migration Algorithms
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing usage patterns might necessitate ...
-
Chapter and Conference Paper
On List Update and Work Function Algorithms
The list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the...
-
Chapter
On the performance of competitive algorithms in practice