Efficient methods for selfish network design (Q442104)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6064502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient methods for selfish network design |
scientific article; zbMATH DE number 6064502 |
Statements
Efficient methods for selfish network design (English)
0 references
9 August 2012
0 references
Braess's paradox
0 references
selfish flows
0 references
Nash equilibrium
0 references
real-world networks
0 references
equilibrium flow delays
0 references
paradox-ridden network
0 references
polynomial-time algorithm
0 references
linear latency
0 references
0 references
0.9991207718849182
0 references
0.9148369431495668
0 references
0.8686800599098206
0 references
0.8586824536323547
0 references
0.8475554585456848
0 references
