Computational complexity of computing a quasi-proper equilibrium (Q2140505): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A relation between perfect equilibria in extensive form games and proper equilibria in normal form games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real computational complexity of minmax value and equilibrium refinements in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of equilibria for extensive two-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two examples of strategic equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a quasi-perfect equilibrium of a two-player game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements of the Nash equilibrium concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reexamination of the perfectness concept for equilibrium points in extensive games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Normal Form Perfect Equilibria for Extensive Two-Person Games / rank
 
Normal rank

Latest revision as of 02:11, 29 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of computing a quasi-proper equilibrium
scientific article

    Statements

    Computational complexity of computing a quasi-proper equilibrium (English)
    0 references
    20 May 2022
    0 references

    Identifiers