Tight Bounds for Selfish and Greedy Load Balancing
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 311-322
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Bounding the inefficiency of equilibria in nonatomic congestion gamesGames and Economic Behavior, 2004
- A New Model for Selfish RoutingLecture Notes in Computer Science, 2004
- Approximate Equilibria and Ball FusionTheory of Computing Systems, 2003
- How bad is selfish routing?Journal of the ACM, 2002
- Ancient and New Algorithms for Load Balancing in the l p NormAlgorithmica, 2001
- Potential GamesGames and Economic Behavior, 1996
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage DevicesJournal of the ACM, 1976
- Worst-Case Analysis of a Placement Algorithm Related to Storage AllocationSIAM Journal on Computing, 1975
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973