How incomputable is finding Nash equilibria?
From MaRDI portal
Recommendations
Cited in
(31)- Computability and randomness of Nash equilibrium in infinite games
- The incompleteness of theories of games
- What is rational about Nash equilibria?
- On the uniform computational content of the Baire category theorem
- A topological view on algebraic computation models
- On the uniform computational content of computability theory
- Equilibria in multi-player multi-outcome infinite sequential games
- Probabilistic computability and choice
- Universality, optimality, and randomness deficiency
- How risky is it to deviate from Nash equilibrium?
- How discontinuous is computing Nash equilibria? (Extended abstract)
- Relative computability and uniform continuity of relations
- Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
- The Vitali Covering Theorem in the Weihrauch Lattice
- Many-one reductions and the category of multivalued functions
- The computational complexity of iterated elimination of dominated strategies
- Computability and analysis, a historical approach
- The Brouwer fixed point theorem revisited
- Weihrauch degrees of finding equilibria in sequential games
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- On the algebraic structure of Weihrauch degrees
- A comparison of concepts from computable analysis and effective descriptive set theory
- On the uniform computational content of Ramsey's theorem
- Weihrauch-completeness for layerwise computability
- Weihrauch Complexity in Computable Analysis
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Connected choice and the Brouwer fixed point theorem
- Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
- Mixed Nash equilibria for continuous games and reverse mathematics
- Erdős-Moser and I _2
This page was built for publication: How incomputable is finding Nash equilibria?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075220)
