Repeated congestion games with bounded rationality (Q444148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6065363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Repeated congestion games with bounded rationality |
scientific article; zbMATH DE number 6065363 |
Statements
Repeated congestion games with bounded rationality (English)
0 references
13 August 2012
0 references
folk theorem
0 references
Braess's paradox
0 references
network routing games
0 references
private monitoring
0 references
public monitoring
0 references
anonymous games
0 references
strategic complexity
0 references
contagion strategy
0 references
calendar strategy
0 references
0 references
0.90360266
0 references
0 references
0.8993218
0 references
0.8944208
0 references
0.8936832
0 references
0 references
0.8932104
0 references
0.8932104
0 references
