Imitation games and computation (Q993779): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2009.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104647222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801629 / 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: Q4003375 / 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: Q5801630 / 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: Reducibility among equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for finding Brouwer fixed points / 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: Games in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expected number of linear complementarity cones intersected by random and semi-random rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lemke Paths on Simple Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple search methods for finding a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard-to-Solve Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average speed of Lemke's algorithm for quadratic programming / rank
 
Normal rank

Latest revision as of 06:25, 3 July 2024

scientific article
Language Label Description Also known as
English
Imitation games and computation
scientific article

    Statements

    Imitation games and computation (English)
    0 references
    0 references
    0 references
    20 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    computational economics
    0 references
    symmetric games
    0 references
    Nash equilibrium
    0 references
    computational complexity
    0 references
    two person games
    0 references
    2-Nash
    0 references
    imitation games
    0 references
    Lemke-Howson algorithm
    0 references
    Lemke paths
    0 references
    0 references