Simple complexity from imitation games (Q2268119): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / 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: Oddness of the number of equilibrium points: a new proof / 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: Maxima for Graphs and a New Proof of a Theorem of Turán / 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: Q4535005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank

Latest revision as of 13:37, 2 July 2024

scientific article
Language Label Description Also known as
English
Simple complexity from imitation games
scientific article

    Statements

    Simple complexity from imitation games (English)
    0 references
    0 references
    0 references
    10 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    imitation games
    0 references
    symmetric games
    0 references
    symmetric Nash equilibria
    0 references
    quadratic programming
    0 references
    stationary points
    0 references
    complexity
    0 references
    NASH
    0 references
    0 references