Online Computation and Competitive Analysis

Allan Borodin, Ran El-Yaniv

414 pages, parution le 04/04/2005

Ajouter à une liste

Indisponible

Résumé

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.

Sommaire

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
On Decision Theories and the Competitive Ratio
A: Glossary
B: Stochastic Analyses for List Accessing Algorithms
C: The Harmonic Random Walk and Its Connection to Electrical Networks
D: Proof of Lemmas 5.4 and 5.5 in Theorem 5.11: FAR Is a Uniformly Optimal Online Paging Algorithm
E: Some Tools from Renewal Theory
F: Proof of Theorem 13.14: Disjoint Paths in an Array
G: Some Tools from the Theory of Types
H: Two Technical Lemmas
Bibliography
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Cambridge University Press
Auteur(s)	Allan Borodin, Ran El-Yaniv
Parution	04/04/2005
Nb. de pages	414
Format	19 x 24,5
Couverture	Broché
Poids	794g
Intérieur	Noir et Blanc
EAN13	9780521619462
ISBN13	978-0-521-61946-2