\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.051 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W83365193 / rank | |||
Normal rank |
Revision as of 23:08, 19 March 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