Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities (Q1072460): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dynamic noncooperative game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria for far-sighted players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821521 / rank
 
Normal rank

Latest revision as of 13:07, 17 June 2024

scientific article
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

    Statements

    Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities (English)
    0 references
    0 references
    0 references
    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
    0 references
    computer analysis
    0 references
    2\(\times 2\) games
    0 references
    maximum, equilibrium and stability calculations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references