Enumeration of Nash equilibria for two-player games (Q847809): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00199-009-0449-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: lrs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / 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.1007/s00199-009-0449-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125467036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of All Extreme Equilibria of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised simplex method with integer Q-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / 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: Maximal nash subsets for bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Strategic Stability of Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR EQUILIBRIUM POINTS IN 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: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nash subsets of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / 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: Strategic Characterization of the Index of an Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of behavior strategies / 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: Q3859602 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00199-009-0449-X / rank
 
Normal rank

Latest revision as of 05:08, 10 December 2024

scientific article
Language Label Description Also known as
English
Enumeration of Nash equilibria for two-player games
scientific article

    Statements

    Enumeration of Nash equilibria for two-player games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    bimatrix game
    0 references
    Nash equilibrium
    0 references
    linear programming
    0 references
    complementarity
    0 references
    0 references
    0 references
    0 references

    Identifiers

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