| Description |
ix, 196 pages : illustrations ; 24 cm |
| Contents |
1. Introduction -- 2. Preliminaries -- 3. How bad is selfish routing? -- 4. Extensions -- 5. Bounding and detecting Braess's paradox -- 6. Stackelberg routing |
| Summary |
"Most of us prefer to commute by the shortest route available, without taking into account the traffic congestion that we cause for others. Many networks, including computer networks, suffer from some type of this "selfish routing." In Selfish Routing and the Price of Anarchy, Tim Roughgarden studies the loss of social welfare caused by selfish, uncoordinated behavior in networks. He quantifies the price of anarchy - the worst-possible loss of social welfare from selfish routing - and also discusses several methods for improving the price of anarchy with centralized control."--BOOK JACKET |
| Bibliography |
Includes bibliographical references (pages [169]-190) and index |
| Subject |
Computer networks -- Design and construction.
|
|
Computational complexity.
|
| LC no. |
2004051172 |
| ISBN |
0262182432 alkaline paper |
|
