In online computation a computer algorithm must decide how to act on incoming items of information without any knowledge of future inputs. How should it route the next telephone call? Where in memory should it store a just-closed record? This book provides an in-depth presentation of competitive analysis, an attractive framework within which such problems can be analyzed and solved. In this framework, the quality of an algorithm is measured relative to the best possible performance of an algorithm that has complete knowledge of the future. This methodology for the analysis of online decision making has become a standard approach in computer science. Starting with the basic definitions of the competitive analysis model, the authors present most of the essential techniques through various examples, some of which are among the central problems of the field, such as list accessing, paging in a virtual memory system, routing in a communication network, metrical task systems, k-server systems, load balancing, search, and portfolio selection. The book also shows how competitive analysis relates to more classical subjects such as game theory and decision theory. This is an important text and reference for researchers and graduate students in theoretical computer science and in operations research.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Editorial Reviews
Review
"The book is very useful for researchers and graduate students in computer science, mathematics and operations research." Mathematical Reviews
Book Description
This graduate text and reference provides an in-depth presentation of competitive analysis, a framework for measuring the performance of online algorithms. The authors present the essential techniques through various examples and applications such as list accessing, paging in a virtual memory system, routing in a communication network, metrical task systems, k-server systems, load balancing, search, and portfolio selection.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
2 of 2 people found the following review helpful:
5.0 out of 5 stars
Excelent book,
Amazon Verified Purchase(What's this?)
This review is from: Online Computation and Competitive Analysis (Paperback)
Excellent book. It's central in the field of online algorithms and competitive analysis, approaching several important problems in the area in a good order and with good explanations. A second edition with the advances in the field on the last decade would be welcome.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
We begin this text by introducing the competitive analysis approach in the context of the list accessing problem, a problem of significant historical, theoretical, and practical interest. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
list accessing problem, list accessing algorithm, weighted paging problem, slow memory pages, brick wall graph, page fault model, optimal offline return, call admission and circuit routing, edge stretch factor, limited duration jobs, access graph model, full access cost model, portfolio selection algorithms, unique optimal algorithm, deterministic paging algorithms, paid transpositions, restricted machines model, resistive inverse, maximum edge congestion, randomized competitive ratio, pure competitive analysis, static list model, algorithmic decision problems, optimal offline cost, harmonic random walk Key Phrases - Capitalized Phrases (CAPs): (learn more)
Prove Theorem, Open Questions, Assume Axioms, Prove Lemma, Using Theorem, Using Lemma, Consider Figure, Work Function Algorithm, Nonlinear Games Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
We begin this text by introducing the competitive analysis approach in the context of the list accessing problem, a problem of significant historical, theoretical, and practical interest. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
list accessing problem, list accessing algorithm, weighted paging problem, slow memory pages, brick wall graph, page fault model, optimal offline return, call admission and circuit routing, edge stretch factor, limited duration jobs, access graph model, full access cost model, portfolio selection algorithms, unique optimal algorithm, deterministic paging algorithms, paid transpositions, restricted machines model, resistive inverse, maximum edge congestion, randomized competitive ratio, pure competitive analysis, static list model, algorithmic decision problems, optimal offline cost, harmonic random walk Key Phrases - Capitalized Phrases (CAPs): (learn more)
Prove Theorem, Open Questions, Assume Axioms, Prove Lemma, Using Theorem, Using Lemma, Consider Figure, Work Function Algorithm, Nonlinear Games Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
48
books
cite this book:
See all 48 books citing this book
- Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings (Lecture Notes in Computer Science) by Friedhelm Meyer auf der Heide on 5 pages
- Stacs 2004 by Volker Diekert on page 281, page 500, and page 630
- Algorithms and Complexity: 4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings (Lecture Notes in Computer Science) by Giancarlo Bongiovanni on page 71, page 136, and page 148
- Fundamentals of Computation Theory: 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings (Lecture Notes in Computer ... Computer Science and General Issues) by Maciej Liskiewicz on page 292, and page 408
- Approximation and Online Algorithms: First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers (Lecture Notes in Computer Science) by Klaus Jansen on page 39, and page 205
See all 48 books citing this book
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
So You'd Like to...
|
|
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Artificial Intelligence > Theory of Computing
- Books > Computers & Technology > Home Computing > Internet > Online Searching
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Software
- Books > New & Used Textbooks > Computer Science > Programming Languages
