Finding a Nash equilibrium in spatial games is an NP-complete problem (Q1424226)

From MaRDI portal
Revision as of 22:25, 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
Finding a Nash equilibrium in spatial games is an NP-complete problem
scientific article

    Statements

    title
    Finding a Nash equilibrium in spatial games is an NP-complete problem (English)
    0 references
    author
    Richard Baron
    0 references
    Jacques Durieu
    0 references
    Hans H. Haller
    0 references
    Philippe Solal
    0 references
    publication date
    11 March 2004
    0 references
    zbMATH DE Number
    2055119
    0 references
    zbMATH Keywords
    Spatial games
    0 references
    NP-completeness
    0 references
    Graph \(k\)-colorability.
    0 references
    OpenAlex ID
    W2011808708
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1424226&oldid=31963638"
    Powered by MediaWiki