Equilibria, fixed points, and complexity classes
From MaRDI portal
(Redirected from Publication:458480)
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485547 (Why is no real title available?)
- scientific article; zbMATH DE number 18531 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 2013849 (Why is no real title available?)
- scientific article; zbMATH DE number 1408945 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- scientific article; zbMATH DE number 3063405 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- A problem that is easier to solve on the unit-cost algebraic RAM
- Algorithmic Game Theory
- Approximate Equilibria for Strategic Two Person Games
- Automata, Languages and Programming
- Branching Processes
- Branching processes in biology
- Computational complexity of fixed points and intersection points
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
- Equilibrium Points of Bimatrix Games
- Excess demand functions
- Existence of an Equilibrium for a Competitive Economy
- Exponential lower bounds for finding Brouwer fixed points
- Graphical games
- Handbook of game theory with economic applications. Vol. 3
- Hard-to-Solve Bimatrix Games
- How easy is local search?
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Nash and Walras equilibrium via Brouwer
- Nash and correlated equilibria: Some complexity considerations
- Neural networks and physical systems with emergent collective computational abilities
- Non-computability of competitive equilibrium
- Non-cooperative games
- On algorithms for discrete and approximate brouwer fixed points
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the complexity of the parity argument and other inefficient proofs of existence
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Optimal solution of nonlinear equations
- Positional strategies for mean payoff games
- Random walks with ``back buttons
- Recursive Concurrent Stochastic Games
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Simple Local Search Problems that are Hard to Solve
- Stochastic Games
- The Approximation of Fixed Points of a Continuous Mapping
- The Euclidean traveling salesman problem is NP-complete
- The NP-completeness column: finding needles in haystacks
- The approximation complexity of win-lose games
- The complexity of computing a Nash equilibrium
- The complexity of equilibria: Hardness results for economies via a correspondence with games
- The complexity of mean payoff games on graphs
- The complexity of pure Nash equilibria
- The complexity of stochastic games
- Theory of games and economic behavior.
Cited in
(13)- Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
- On the Complexity of Equilibrium Computation in First-Price Auctions
- Equilibria, fixed points, and complexity classes
- Computational aspects of equilibria
- On the complexity of local search in unconstrained quadratic binary optimization
- Unique end of potential line
- Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
- The complexity of gradient descent (invited talk)
- On the complexity of core, kernel, and bargaining set
- Existence of positive solutions for a class of nonlinear algebraic systems
- Fixed points, Nash equilibria, and the existential theory of the reals
- 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)
