On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Acceptable points in games of perfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of decision problems about multi-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of rational and irrational Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computational problems about Nash equilibria in symmetric win-lose games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exotic quantifiers, complexity classes, and complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of some problems of linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / 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: On the Complexity of Nash Equilibria and Other 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: The real computational complexity of minmax value and equilibrium refinements in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining \(\mathbb Z\) in \(\mathbb Q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling Some Open Problems on 2-Player Symmetric Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / 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: Realizability of Graphs and Linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points, Nash equilibria, and the existential theory of the reals / rank
 
Normal rank

Latest revision as of 10:18, 29 July 2024

scientific article; zbMATH DE number 7545289
Language Label Description Also known as
English
On the computational complexity of decision problems about multi-player Nash equilibria
scientific article; zbMATH DE number 7545289

    Statements

    On the computational complexity of decision problems about multi-player Nash equilibria (English)
    0 references
    21 June 2022
    0 references
    Nash equilibrium
    0 references
    computational complexity
    0 references
    existential theory of the reals
    0 references
    0 references

    Identifiers

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