Equilibria, fixed points, and complexity classes

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) (n)-person games, (n>2) (91A06)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The complexity of stochastic games
The complexity of mean payoff games on graphs
Handbook of game theory with economic applications. Vol. 3
Non-cooperative games
Algorithmic Game Theory
Introduction to Matrix Analytic Methods in Stochastic Modeling
Stochastic Games
Theory of games and economic behavior.
A class of games possessing pure-strategy Nash equilibria
Neural networks and physical systems with emergent collective computational abilities.
Branching Processes
Existence of an Equilibrium for a Competitive Economy
The Euclidean traveling salesman problem is NP-complete
On the Complexity of Nash Equilibria and Other Fixed Points
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Branching processes in biology
How easy is local search?
On the complexity of the parity argument and other inefficient proofs of existence
Equilibrium Points of Bimatrix Games
The Approximation of Fixed Points of a Continuous Mapping
Nash and Walras equilibrium via Brouwer
The complexity of pure Nash equilibria
Positional strategies for mean payoff games
Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
Simple Local Search Problems that are Hard to Solve
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
The complexity of computing a Nash equilibrium
Recursive Concurrent Stochastic Games
Automata, Languages and Programming
Random walks with ``back buttons
Nash and correlated equilibria: Some complexity considerations
Optimal solution of nonlinear equations
A problem that is easier to solve on the unit-cost algebraic RAM
Non-computability of competitive equilibrium
Excess demand functions
Computational complexity of fixed points and intersection points
On algorithms for discrete and approximate brouwer fixed points
The NP-completeness column
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
Approximate Equilibria for Strategic Two Person Games
Hard-to-Solve Bimatrix Games
Exponential lower bounds for finding Brouwer fixed points
The complexity of equilibria: Hardness results for economies via a correspondence with games

Cited In (7)

Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
On the Complexity of Equilibrium Computation in First-Price Auctions
On the complexity of local search in unconstrained quadratic binary optimization
On the complexity of core, kernel, and bargaining set
Existence of positive solutions for a class of nonlinear algebraic systems
The intermediate value theorem and decision-making in psychology and economics: an expositional consolidation
Positive solutions of a nonlinear algebraic system with sign-changing coefficient matrix

This page was built for publication: Equilibria, fixed points, and complexity classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458480)