Price of anarchy for highly congested routing games in parallel networks (Q1733382)
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: Price of anarchy for highly congested routing games in parallel networks |
scientific article; zbMATH DE number 7040093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Price of anarchy for highly congested routing games in parallel networks |
scientific article; zbMATH DE number 7040093 |
Statements
Price of anarchy for highly congested routing games in parallel networks (English)
0 references
21 March 2019
0 references
nonatomic routing games
0 references
price of anarchy
0 references
regularly varying functions
0 references
wardrop equilibrium
0 references
parallel networks
0 references
high congestion
0 references
0.9400194
0 references
0.9238746
0 references
0.92209494
0 references
0.9172889
0 references
0.9166309
0 references
0.9166308
0 references
0.91165274
0 references
