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

From MaRDI portal
Revision as of 18:34, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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 Keywords
    Spatial games
    0 references
    NP-completeness
    0 references
    Graph \(k\)-colorability.
    0 references

    Identifiers

    zbMATH DE Number
    2055119
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1424226&oldid=13591365"
    Powered by MediaWiki