$\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games (Q3599089)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games |
scientific article |
Statements
$\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games (English)
0 references
3 February 2009
0 references
Nash equilibrium
0 references
\(\mathcal{NP}\)-hardness
0 references
