The effectiveness of Stackelberg strategies and tolls for network congestion games (Q3189079)
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: The effectiveness of Stackelberg strategies and tolls for network congestion games |
scientific article; zbMATH DE number 6341948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The effectiveness of Stackelberg strategies and tolls for network congestion games |
scientific article; zbMATH DE number 6341948 |
Statements
The effectiveness of stackelberg strategies and tolls for network congestion games (English)
0 references
9 September 2014
0 references
algorithmic game theory
0 references
convex optimization
0 references
price of anarchy
0 references
routing and congestion games
0 references
0.9987515807151794
0 references
0.8982124924659729
0 references
0.8879150152206421
0 references
0.8867936134338379
0 references
0.8840239644050598
0 references
