Nash equilibria: complexity, symmetries, and approximation (Q458482): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91-02 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68-02 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6352109 / rank
 
Normal rank
Property / zbMATH Keywords
 
Nash equilibria
Property / zbMATH Keywords: Nash equilibria / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / 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.1016/j.cosrev.2009.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W122730496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / 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: Approximate Nash equilibria in anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient PTAS for Two-Strategy Anonymous Games / 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: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Equilibria of <i>N</i>-Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Generalization of the Lemke–Howson Algorithm to Noncooperative <i>N</i>-Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximation of Fixed Points of a Continuous Mapping / 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: Nash and correlated equilibria: Some complexity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / 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: On the complexity of the parity argument and other inefficient proofs of existence / 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: Games of fixed rank: a hierarchy of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate Nash equilibria / 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: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The women of Cairo: equilibria in large anonymous games / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:38, 9 July 2024

scientific article
Language Label Description Also known as
English
Nash equilibria: complexity, symmetries, and approximation
scientific article

    Statements

    Nash equilibria: complexity, symmetries, and approximation (English)
    0 references
    7 October 2014
    0 references
    Nash equilibria
    0 references
    complexity
    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
    0 references