On the hardness of network design for bottleneck routing games (Q389953)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of network design for bottleneck routing games |
scientific article; zbMATH DE number 6248971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of network design for bottleneck routing games |
scientific article; zbMATH DE number 6248971 |
Statements
On the hardness of network design for bottleneck routing games (English)
0 references
22 January 2014
0 references
bottleneck routing games
0 references
Braess's paradox
0 references
selfish network design
0 references
0.9900879859924316
0 references
0.9000300168991089
0 references
0.8709346652030945
0 references
0.8686800599098206
0 references
0.8652330636978149
0 references
