Skip to content

Online Computation and Competitive Analysis

Best in textbook rentals since 2012!

ISBN-10: 0521619467

ISBN-13: 9780521619462

Edition: 2005

Authors: Allan Borodin, Ran El-Yaniv

List price: $101.00
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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…    
Customers also bought

Book details

List price: $101.00
Copyright year: 2005
Publisher: Cambridge University Press
Publication date: 2/17/2005
Binding: Paperback
Pages: 436
Size: 7.40" wide x 9.69" long x 0.87" tall
Weight: 1.694
Language: English

Preface
Introduction to competitive analysis: the list accessing problem
Introduction to randomized algorithms: the list accessing problem
Paging: deterministic algorithms
Paging: randomized algorithms
Alternative models for paging: beyond pure competitive analysis
Game theoretic foundations
Request - answer games
Competitive analysis and zero-sum games
Metrical task systems
The k-server problem
Randomized k-server algorithms
Load-balancing
Call admission and circuit-routing
Search, trading and portfolio selection
Competitive analysis and decision making under uncertainty
Appendices
Bibliography
Index