How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618)
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: How hard is it to find extreme Nash equilibria in network congestion games? |
scientific article; zbMATH DE number 5626967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How hard is it to find extreme Nash equilibria in network congestion games? |
scientific article; zbMATH DE number 5626967 |
Statements
How hard is it to find extreme Nash equilibria in network congestion games? (English)
0 references
6 November 2009
0 references
network congestion game
0 references
unsplittable flow
0 references
makespan objective
0 references
extreme equilibria
0 references
complexity
0 references
non-cooperative games
0 references
0.9398649
0 references
0 references
0.8771165
0 references
0.8771165
0 references
0 references
0.8625274
0 references
0 references
