Fast Algorithms for Rank-1 Bimatrix Games (Q4994178): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A geometric view of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-1 bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Nash equilibria for two-player games / 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: A friendly smoothed analysis of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / 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: Nash and correlated equilibria: Some complexity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global Newton method to compute Nash equilibria. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in linear programming: Just be careful! / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of stable sets and strictly perfect equilibria. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal nash subsets for bimatrix games / 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: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Strategic Stability of Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization 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: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-person nonzero-sum games and quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Rank Two-Player Games are PPAD-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of parametric linear programming / 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: Hard-to-Solve Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating the Nash equilibria of rank 1-games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Market equilibrium under separable, piecewise-linear, concave utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: New maximal numbers of equilibria in bimatrix games / 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: Row Rank Equals Column Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Simply Stable Equilibria / rank
 
Normal rank

Revision as of 00:00, 26 July 2024

scientific article; zbMATH DE number 7360297
Language Label Description Also known as
English
Fast Algorithms for Rank-1 Bimatrix Games
scientific article; zbMATH DE number 7360297

    Statements

    Fast Algorithms for Rank-1 Bimatrix Games (English)
    0 references
    17 June 2021
    0 references
    bimatrix game
    0 references
    Nash equilibrium
    0 references
    rank-1 game
    0 references
    polynomial-time algorithm
    0 references
    homeomorphism
    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