Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions |
scientific article |
Statements
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (English)
0 references
12 March 2021
0 references
approximate Nash equilibrium
0 references
Shapley cost sharing method
0 references
network congestion games
0 references
cut games
0 references
PLS-completeness
0 references
0 references
0 references
