scientific article
From MaRDI portal
Publication:3075220
zbMath1216.91004MaRDI QIDQ3075220
Publication date: 10 February 2011
Full work available at URL: http://www.jucs.org/jucs_16_18/how_incomputable_is_finding
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (24)
On the uniform computational content of the Baire category theorem ⋮ 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 ⋮ Relative computability and uniform continuity of relations ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ Mixed Nash equilibria for continuous games and reverse mathematics ⋮ On the uniform computational content of computability theory ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Closed choice and a uniform low basis theorem ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Many-one reductions and the category of multivalued functions ⋮ Equilibria in multi-player multi-outcome infinite sequential games ⋮ On the algebraic structure of Weihrauch degrees ⋮ Connected choice and the Brouwer fixed point theorem ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ Probabilistic computability and choice ⋮ Unnamed Item ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency
This page was built for publication:
