Symmetries and the complexity of pure Nash equilibrium (Q1004282): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subjectivity and correlation in randomized strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria of graphical games with symmetries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / 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: Q4633883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715720 / 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: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3252269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Local Search in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2892811 / rank
 
Normal rank

Latest revision as of 03:24, 29 June 2024

scientific article
Language Label Description Also known as
English
Symmetries and the complexity of pure Nash equilibrium
scientific article

    Statements

    Symmetries and the complexity of pure Nash equilibrium (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2009
    0 references
    0 references
    game theory
    0 references
    normal-form games
    0 references
    symmetries
    0 references
    pure Nash equilibrium
    0 references
    computational complexity
    0 references
    0 references