Binary 2x2 games
From MaRDI portal
2\(\times 2\) bimatrix games are considered in which no restrictions over the preference scales are accepted. The main goal of the paper is to classify such games according to their preference structures, and to characterize the Nash equilibria for particular classes of the games.
Recommendations
Cites work
- scientific article; zbMATH DE number 4087369 (Why is no real title available?)
- scientific article; zbMATH DE number 50042 (Why is no real title available?)
- scientific article; zbMATH DE number 3207761 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Non-strict ordinal 2\(\times 2\) games: A comprehensive computer-assisted analysis of the 726 possibilities
- Noncooperative games and nontransitive preferences
Cited in
(11)- Classification of two-person ordinal bimatrix games
- Binary action games: deviation properties, semi-strict equilibria and potentials
- Classification by decomposition: a novel approach to classification of symmetric 2 2 games
- Nash equilibria in 2 2 2 trimatrix games with identical anonymous best-replies
- Feasibility of classification on two kinds of 2-person noncooperative finite games
- Finite neighborhood games with binary choices
- scientific article; zbMATH DE number 4033535 (Why is no real title available?)
- Obituary: Peter C. Fishburn (1936--2021)
- Economic foundations of generalized games with shared constraint: do binding agreements lead to less Nash equilibria?
- Classifying limited-move stability cycles in 2 2 games
- A taxonomy of best-reply multifunctions in \(2\times 2\times 2\) trimatrix games
This page was built for publication: Binary 2x2 games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757259)