10 Result(s)
within
Chapter
Anna R. Karlin
Algorithm Analysis and Problem Complexity
Data Structures
-
Chapter and Conference Paper
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
In this paper, we study the integrality gap of the Knapsack linear program in the Sherali-Adams and Lasserre hierarchies. First, we show that an integrality gap of 2 – ε persists up to a linear number of rounds o...
-
Chapter and Conference Paper
On Revenue Maximization in Second-Price Ad Auctions
Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first-price auction, which does not realistic...
-
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
A Lower Bound on the Competitive Ratio of Truthful Auctions
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [6,3] that compares the profit of an auction to that of an optimal s...
-
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
Dynamically Fault-Tolerant Content Addressable Networks
We describe a content addressable network which is robust in the face of massive adversarial attacks and in a highly dynamic environment. Our network is robust in the sense that at any time, an arbitrarily lar...
-
Chapter and Conference Paper
Spectral Analysis for Data Mining
Experimental evidence suggests that spectral techniques are valuable for a wide range of applications. A partial list of such applications include (i) semantic analysis of documents used to cluster documents i...
-
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...
