\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917)
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: NP-hardness of pure Nash equilibrium in scheduling and network design games |
scientific article; zbMATH DE number 6243794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games |
scientific article; zbMATH DE number 6243794 |
Statements
\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (English)
0 references
9 January 2014
0 references
pure Nash equilibria
0 references
\(\mathcal{NP}\)-hardness
0 references
scheduling games
0 references
network design games
0 references
0 references
0.9631996
0 references
0.88934886
0 references
0.8856498
0 references
0.87578195
0 references
0.87566394
0 references
0.87566394
0 references
0.87361974
0 references
