On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739)

From MaRDI portal
Revision as of 14:36, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
scientific article

    Statements

    On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (English)
    0 references
    0 references
    0 references
    4 December 2009
    0 references
    NP-completeness
    0 references
    computational complexity
    0 references
    bimatrix games
    0 references
    Nash equilibrium
    0 references
    imitation games
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references