The Complexity of Computing a Nash Equilibrium (Q5189544)

From MaRDI portal
Revision as of 03:21, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5682431
Language Label Description Also known as
English
The Complexity of Computing a Nash Equilibrium
scientific article; zbMATH DE number 5682431

    Statements

    title
    The Complexity of Computing a Nash Equilibrium (English)
    0 references
    DOI
    10.1137/070699652
    0 references
    publication date
    17 March 2010
    0 references
    Mathematics Subject Classification ID
    91A05
    0 references
    91A10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5682431
    0 references
    zbMATH Keywords
    complexity
    0 references
    Nash equilibrium
    0 references
    game theory
    0 references
    PPAD-completeness
    0 references
    Wikidata QID
    Q30053762
    0 references
    OpenAlex ID
    W2002373723
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5189544&oldid=32976242"
    Powered by MediaWiki