Approximate truthful mechanisms for the knapsack problem, and negative results using a stack model for local ratio algorithms.
Our rough guess is there are 17,000 words in this book.
At a pace averaging 250 words per minute, this book will take 1 hours and 8 minutes to read. With a half hour per day, this will take 2 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
17,000 words, Guess
Page Count
68 pages
Identifiers
- ISBN-100494024658
- ISBN-139780494024652
- Open LibraryOL19215909M
Description
This thesis examines two topics in approximation algorithms. Mechanism design considers algorithmic problems in which agents behave based on selfish needs, rather than the will of the mechanism. For the knapsack problem, a number of approximate mechanisms are described that guarantees truthful agent behavior, including an FPTAS recently constructed by Alberto Marchetti-Spaccamela. Results relating truthfulness to the priority algorithm framework of Borodin, Nielsen and Rackoff are shown.A formal algorithmic model, called the stack algorithm, is defined, that captures the behavior of the local ratio method. The bandwidth problem is defined, and limitations are shown on the approximation power of the stack algorithm in a number of variations, including 2 machine scheduling. For covering problems, approximation lower bounds are shown for the Steiner tree and set cover problems.
Subjects
Links
Other Editions
- Approximate truthful mechanisms for the knapsack problem, and negative results using a stack model for local ratio algorithms.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!