\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:18, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games |
scientific article |
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