Skip to content
Register Sign in Wishlist
Look Inside Online Computation and Competitive Analysis

Online Computation and Competitive Analysis

$89.99 (P)

  • Date Published: February 2005
  • availability: Available
  • format: Paperback
  • isbn: 9780521619462

$ 89.99 (P)
Paperback

Add to cart Add to wishlist

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Self-contained, while providing references to related subjects and specific results, with unifying notation and terminology
    • Contains the most comprehensive bibliography available on the subject of competitive analysis plus historical review of major results
    • Numerous exercises plus research problems that can provide the basis for MSc and PhD thesis work
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: February 2005
    • format: Paperback
    • isbn: 9780521619462
    • length: 436 pages
    • dimensions: 246 x 189 x 23 mm
    • weight: 0.78kg
    • contains: 39 b/w illus. 7 tables
    • availability: Available
  • Table of Contents

    Preface
    1. Introduction to competitive analysis: the list accessing problem
    2. Introduction to randomized algorithms: the list accessing problem
    3. Paging: deterministic algorithms
    4. Paging: randomized algorithms
    5. Alternative models for paging: beyond pure competitive analysis
    6. Game theoretic foundations
    7. Request - answer games
    8. Competitive analysis and zero-sum games
    9. Metrical task systems
    10. The k-server problem
    11. Randomized k-server algorithms
    12. Load-balancing
    13. Call admission and circuit-routing
    14. Search, trading and portfolio selection
    15. Competitive analysis and decision making under uncertainty
    Appendices
    Bibliography
    Index.

  • Authors

    Allan Borodin, University of Toronto

    Ran El-Yaniv, Technion - Israel Institute of Technology, Haifa

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×