Complexity of pure Nash equilibria in player-specific network congestion games (Q3574299)
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: Complexity of pure Nash equilibria in player-specific network congestion games |
scientific article; zbMATH DE number 5734765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of pure Nash equilibria in player-specific network congestion games |
scientific article; zbMATH DE number 5734765 |
Statements
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games (English)
0 references
9 July 2010
0 references
0.8927169442176819
0 references
0.8917981386184692
0 references
0.8740808367729187
0 references
0.8593711853027344
0 references
0.8581510186195374
0 references
