  This chapter introduces resource augmentation, in which the performance of an
algorithm is compared to the best-possible solution that is handicapped by less
resources. We consider three case studies: online paging, with cache size as
the resource; selfish routing, with capacity as the resource; and scheduling,
with processor speed as the resource. Resource augmentation bounds also imply
"loosely competitive" bounds, which show that an algorithm's performance is
near-optimal for most resource levels.
