On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (Q1939257)

From MaRDI portal
Revision as of 19:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix
scientific article

    Statements

    On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (English)
    0 references
    0 references
    4 March 2013
    0 references
    0 references
    computational economics
    0 references
    bimatrix game
    0 references
    degeneracy
    0 references
    sparsity
    0 references
    NP-complete
    0 references
    0 references