Constant Rank Two-Player Games are PPAD-hard (Q4554071): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of linear programs and zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-1 bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate rank of a matrix and its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Solving Stochastic Games on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium tracing in strategic-form games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria in random games / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for approximate Nash equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On competitiveness in uniform utility allocation markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of 2D Discrete Fixed Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808751 / 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 oblivious PTAS's for 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 the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of fixed rank: a hierarchy of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Fractional Stability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple complexity from imitation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling Some Open Problems on 2-Player Symmetric Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999542 / 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: Q3524711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard-to-Solve Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for finding Nash equilibria in bi-matrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524712 / rank
 
Normal rank

Revision as of 06:30, 17 July 2024

scientific article; zbMATH DE number 6974575
Language Label Description Also known as
English
Constant Rank Two-Player Games are PPAD-hard
scientific article; zbMATH DE number 6974575

    Statements

    Constant Rank Two-Player Games are PPAD-hard (English)
    0 references
    0 references
    7 November 2018
    0 references
    bimatrix games
    0 references
    constant rank
    0 references
    Nash equilibrium
    0 references
    PPAD-hard
    0 references
    LCP
    0 references
    parameterized LP
    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