On the Complexity of Nash Equilibria and Other Fixed Points
From MaRDI portal
(Redirected from Publication:3068643)
Recommendations
- On the complexity of approximating a Nash equilibrium
- scientific article; zbMATH DE number 6783488
- The complexity of pure Nash equilibria
- The complexity of finding Nash equilibria
- The complexity of computing a Nash equilibrium
- The complexity of computing a Nash equilibrium
- Nash equilibria: complexity, symmetries, and approximation
- Complexity of rational and irrational Nash equilibria
- Complexity of rational and irrational Nash equilibria
- On the computational complexity of decision problems about multi-player Nash equilibria
Cited in
(only showing first 100 items - show all)- New algorithms for approximate Nash equilibria in bimatrix games
- Fixed points, Nash games and their organizations
- Finding a Nash equilibrium in spatial games is an NP-complete problem
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- The complexity of optimal multidimensional pricing for a unit-demand buyer
- Complexity of rational and irrational Nash equilibria
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- Lipschitz continuity and approximate equilibria
- Two's company, three's a crowd: consensus-halving for a constant number of agents
- Discrete versions of the KKM lemma and their PPAD-completeness
- Computational complexity of computing a quasi-proper equilibrium
- Unique end of potential line
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- The Hairy Ball problem is PPAD-complete
- On the entropy of couplings
- Query complexity of approximate equilibria in anonymous games
- Recursive stochastic games with positive rewards
- Uniqueness of stationary equilibrium payoffs in coalitional bargaining
- Understanding science through the computational lens
- The complexity of computational problems about Nash equilibria in symmetric win-lose games
- Belief and truth in hypothesised behaviours
- Recursive Markov decision processes and recursive stochastic games
- Computing equilibria for a service provider game with (im)perfect information
- Ratio and weight quantiles
- Inapproximability of NP-Complete Variants of Nash Equilibrium
- The Complexity of Nash Equilibria in Limit-Average Games
- On Nash-equilibria of approximation-stable games
- A direct reduction from k-player to 2-player approximate Nash equilibrium
- 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
- Graph Games and Reactive Synthesis
- ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
- Settling the complexity of computing two-player Nash equilibria
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Query complexity of approximate equilibria in anonymous games
- scientific article; zbMATH DE number 5722763 (Why is no real title available?)
- Bounding the sum of square roots via lattice reduction
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- Computational aspects of equilibria
- Constant rank two-player games are PPAD-hard
- Computational tameness of classical non-causal models
- Incentive Stackelberg mean-payoff games
- On perfect Nash equilibria of polymatrix games
- Recent development in computational complexity characterization of Nash equilibrium
- Equilibria, fixed points, and complexity classes
- Nash equilibria: complexity, symmetries, and approximation
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- Equilibria, fixed points, and complexity classes
- Fast Algorithms for Rank-1 Bimatrix Games
- Nash equilibrium points for generalized matrix game model with interval payoffs
- scientific article; zbMATH DE number 7559416 (Why is no real title available?)
- Solving simple stochastic games with few random nodes faster using Bland's rule
- Unique End of Potential Line
- The Hairy Ball Problem is PPAD-Complete.
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
- Contiguous cake cutting: hardness results and approximation algorithms
- Computing approximate Nash equilibria in polymatrix games
- On Stackelberg mixed strategies
- On oblivious PTAS's for nash equilibrium
- Fixed points, Nash equilibria, and the existential theory of the reals
- Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A polynomial time algorithm for computing extinction probabilities of multitype branching processes
- scientific article; zbMATH DE number 6783488 (Why is no real title available?)
- Reducibility among fractional stability problems
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- The complexity of the homotopy method, equilibrium selection and Lemke-Howson solutions
- Consensus Halving for Sets of Items
- Asymmetric Distances for Approximate Differential Privacy
- Tarski's theorem, supermodular games, and the complexity of equilibria
- scientific article; zbMATH DE number 7662165 (Why is no real title available?)
- On the Complexity of Equilibrium Computation in First-Price Auctions
- Consensus-Halving: Does It Ever Get Easier?
- On the computational complexity of decision problems about multi-player Nash equilibria
- The real computational complexity of minmax value and equilibrium refinements in multi-player games
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- Financial networks with singleton liability priorities
- Financial networks with singleton liability priorities
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games
- Tight inapproximability of Nash equilibria in public goods games
- The complexity of gradient descent: CLS = PPAD pls
- Identity testing for radical expressions
- Algorithms and complexity for computing Nash equilibria in adversarial team games
- Tree polymatrix games are PPAD-hard
- Improved hardness results for the clearing problem in financial networks with credit default swaps
- Mixed Nash equilibria in discrete Tullock contests
- Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
- The complexity of computing in continuous time: space complexity is precision
- Automating approximation analysis for Nash equilibria algorithms in two-player games
- The complexity of computing KKT solutions of quadratic programs
- Pizza sharing is PPA-hard
- Nash meets Łukasiewicz: computing equilibria through logic
- Computing a fixed point of contraction maps in polynomial queries
- On the optimal mixing problem of approximate Nash equilibria in bimatrix games
- Pure-circuit: tight inapproximability for PPAD
- Computational complexity of the Hylland-Zeckhauser mechanism for one-sided matching markets
- Constant inapproximability for PPA
- On the optimal mixing problem of approximate Nash equilibria in bimatrix games
This page was built for publication: On the Complexity of Nash Equilibria and Other Fixed Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068643)
