Atomic routing game with capacity constraints (Q2173050)
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 7191647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Atomic routing game with capacity constraints |
scientific article; zbMATH DE number 7191647 |
Statements
Atomic routing game with capacity constraints (English)
0 references
22 April 2020
0 references
network games
0 references
routing games
0 references
network flows
0 references
Nash equilibrium
0 references
algorithm for finding equilibrium
0 references
0 references
0.984412670135498
0 references
0.8057551980018616
0 references
0.8055214881896973
0 references
0.8042724132537842
0 references
0.8020651936531067
0 references
