The computational complexity of weak saddles (Q647484)

From MaRDI portal
Revision as of 16:55, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The computational complexity of weak saddles
scientific article

    Statements

    title
    The computational complexity of weak saddles (English)
    0 references
    author
    Felix Brandt
    0 references
    Markus Brill
    0 references
    Felix Fischer
    0 references
    Jan Hoffmann
    0 references
    publication date
    23 November 2011
    0 references
    Mathematics Subject Classification ID
    91A05
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5977800
    0 references
    zbMATH Keywords
    game theory
    0 references
    solution concepts
    0 references
    Shapley's saddles
    0 references
    computational complexity
    0 references
    OpenAlex ID
    W4238938794
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q647484&oldid=35255206"
    Powered by MediaWiki