COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE (Q5408357): Difference between revisions
From MaRDI portal
Latest revision as of 09:18, 30 July 2024
scientific article; zbMATH DE number 6282218
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE |
scientific article; zbMATH DE number 6282218 |
Statements
COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE (English)
0 references
10 April 2014
0 references
congestion games
0 references
computational complexity
0 references
Nash equilibria
0 references
\(\mathcal{PLS}\)
0 references
