How complex are networks playing repeated games? (Q1275882): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s001990050243 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090947688 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How complex are networks playing repeated games? |
scientific article |
Statements
How complex are networks playing repeated games? (English)
0 references
4 August 1999
0 references
network
0 references
complexity
0 references
repeated games
0 references
networks with finitely many classifiers
0 references
repeated play
0 references
locally stable equilibrium
0 references
