A robust saturated strategy for \(n\)-player prisoner's dilemma (Q4685372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A robust saturated strategy for n-player prisoner's dilemma |
scientific article; zbMATH DE number 6948672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A robust saturated strategy for \(n\)-player prisoner's dilemma |
scientific article; zbMATH DE number 6948672 |
Statements
A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma (English)
0 references
8 October 2018
0 references
prisoner's dilemma
0 references
dynamic games
0 references
stability
0 references
equilibria
0 references
invariant sets
0 references
0 references
0 references
0 references
0.7842643857002258
0 references
0.7773144245147705
0 references
0.7663286924362183
0 references
0.759040117263794
0 references
0.7582127451896667
0 references
