The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464)

From MaRDI portal
Revision as of 15:40, 24 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 complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
scientific article

    Statements

    The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (English)
    0 references
    0 references
    23 February 2021
    0 references
    extensive form game
    0 references
    perfect equilibrium
    0 references
    quasi-perfect equilibrium
    0 references
    algorithms
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references