A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538)

From MaRDI portal
Revision as of 22:43, 10 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
A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
scientific article

    Statements

    title
    A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (English)
    0 references
    author
    Pedro A. Góngora
    0 references
    David A. Rosenblueth
    0 references
    publication date
    16 October 2015
    0 references
    Mathematics Subject Classification ID
    91A10
    0 references
    52B05
    0 references
    05C90
    0 references
    zbMATH DE Number
    6495516
    0 references
    zbMATH Keywords
    shortest path
    0 references
    Bellman-Ford
    0 references
    Nash equilibrium
    0 references
    binary decision diagram (BDD)
    0 references
    model checking
    0 references
    OpenAlex ID
    W2261527979
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q747538&oldid=36206843"
    Powered by MediaWiki