The complexity of computing a Nash equilibrium (Q2931371)

From MaRDI portal
Revision as of 02:21, 20 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
The complexity of computing a Nash equilibrium
scientific article

    Statements

    title
    The complexity of computing a Nash equilibrium (English)
    0 references
    publication date
    25 November 2014
    0 references
    zbMATH Keywords
    Nash equilibrium
    0 references
    PPAD-completeness
    0 references
    complexity
    0 references
    game theory
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    91A05
    0 references
    91A10
    0 references
    zbMATH DE Number
    6373877
    0 references
    OpenAlex ID
    W2140790422
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2931371&oldid=32976587"
    Powered by MediaWiki