Online computation and competitive analysis
- Cambridge: Cambridge University Press, 2005
- xviii, 414 p.; ill.: 25 cm.
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.
0521619467 (pbk)
Computational complexity Computer algorithms Mathematical optimization Competitive Analysis Game Theoretic Foundations Metrical Task Systems