Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities (Q1072460)
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: Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities |
scientific article; zbMATH DE number 3941299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities |
scientific article; zbMATH DE number 3941299 |
Statements
Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities (English)
0 references
1986
0 references
Game theory has provided many tools for the study of social conflict. The \(2\times 2\) game has been found to be a particularly useful model. This paper describes the enumeration and analysis of all 726 distinct \(2\times 2\) games. A computer is used to generate the complete set, and a wide variety of maximum, equilibrium and stability calculations is performed for each player for every outcome in every game. The resulting data set is of great value for both the modeling and analysis of social conflict.
0 references
computer analysis
0 references
2\(\times 2\) games
0 references
maximum, equilibrium and stability calculations
0 references