Name
Abstract | ||
|---|---|---|
Routing games are frequently used to model the behavior of traffic in large networks, such as road networks. In transportation research, the problem of adding capacity to a road network in a cost-effective manner to minimize the total delay at equilibrium is known as the Network Design Problem, and has received considerable attention. However, prior to our work, little was known about guarantees for polynomial-time algorithms for this problem. We obtain tight approximation guarantees for general and series-parallel networks, and present a number of open questions for future work. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2728732.2728737 | ACM SIGecom Exchanges |
Keywords | DocType | Volume |
Routing games, network design, Wardrop equilibrium | Conference | 13 |
Issue | ISSN | Citations |
2 | 1551-9031 | 2 |
PageRank | References | Authors |
0.42 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Umang Bhaskar | 1 | 67 | 11.75 |
| Katrina Ligett | 2 | 923 | 66.19 |
| Leonard J. Schulman | 3 | 1328 | 136.88 |