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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gambit / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.geb.2019.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081265119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: "Almost" Implies "Near" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algebraic Geometry of Perfect and Sequential Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Nash Equilibrium / 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: 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: Nash and correlated equilibria: Some complexity considerations / 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: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-person zero-sum games in extensive form / 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: SIMPLICIAL APPROXIMATION OF FIXED POINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two examples of strategic equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing sequential equilibria for two-player games / 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: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between (quasi-)perfect and sequential equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twenty Lectures on Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximation of Fixed Points of a Continuous Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070959 / 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: 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: Q4002161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of behavior strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Normal Form Perfect Equilibria for Extensive Two-Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Equilibria of Two-Person Games from the Extensive Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path-following procedure to find a proper equilibrium of finite games / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:40, 24 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references