The computational complexity of evolutionarily stable strategies (Q926196)

From MaRDI portal
Revision as of 08:20, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The computational complexity of evolutionarily stable strategies
scientific article

    Statements

    title
    The computational complexity of evolutionarily stable strategies (English)
    0 references
    publication date
    26 May 2008
    0 references
    zbMATH Keywords
    Computational complexity
    0 references
    Game theory
    0 references
    Evolutionarily stable strategies
    0 references
    Evolutionary biology
    0 references
    Nash equilibria
    0 references
    author
    Kousha Etessami
    0 references
    Andreas Lochbihler
    0 references
    cites work
    Q4198056
    0 references
    Q4220393
    0 references
    Q3222981
    0 references
    Q3040961
    0 references
    Non-cooperative games
    0 references
    Q3576736
    0 references
    Q4298260
    0 references
    Q4535005
    0 references
    Q4002161
    0 references

    Identifiers

    zbMATH DE Number
    5278978
    0 references
    OpenAlex ID
    W2033259331
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q926196&oldid=38534888"
    Powered by MediaWiki