A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (Q3503628): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimal and locally minimal games and game forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-colourings that decompose perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3701227 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Absolutely determined matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5332984 / rank | |||
Normal rank |
Latest revision as of 11:24, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames |
scientific article |
Statements
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (English)
0 references
5 June 2008
0 references
0 references