Achieving target equilibria in network routing games without knowing the latency functions (Q2278946)
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 7142496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Achieving target equilibria in network routing games without knowing the latency functions |
scientific article; zbMATH DE number 7142496 |
Statements
Achieving target equilibria in network routing games without knowing the latency functions (English)
0 references
12 December 2019
0 references
routing games
0 references
network flows
0 references
tolls
0 references
Stackelberg routing
0 references
query complexity
0 references
ellipsoid algorithm
0 references
0 references
0 references
0 references
0.7842916250228882
0 references
0.7823745012283325
0 references
0.7788437604904175
0 references
0.7741214036941528
0 references
0.7735651135444641
0 references
