Lower bounds on degrees of game-theoretic structures
From MaRDI portal
(Redirected from Publication:1106754)
Recommendations
- Game characterizations and lower cones in the Weihrauch degrees
- Game characterizations and lower cones in the Weihrauch degrees
- A note on degrees of presentation of games as relational structures
- Minimum degree games for graphs
- On a game theoretic cardinality bound
- Polytope-form games and index/degree theories for extensive-form games
- The lattice structure of n-player games
- The degree value for games with communication structure
Cites work
- scientific article; zbMATH DE number 3128730 (Why is no real title available?)
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 3778752 (Why is no real title available?)
- scientific article; zbMATH DE number 3784267 (Why is no real title available?)
- scientific article; zbMATH DE number 3478856 (Why is no real title available?)
- scientific article; zbMATH DE number 3215740 (Why is no real title available?)
- scientific article; zbMATH DE number 3230252 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- scientific article; zbMATH DE number 3387326 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3078993 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Complexity of winning strategies
- Computational complexity of recursively enumerable sets
- Countable retracing functions and _2⁰ predicates
- Degrees of Computability
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Degrees of unsolvability: structure and theory
- Diagonalization in degree constructions
- Effective operations in a general setting
- Equilibrium points in n -person games
- Existence of an Equilibrium for a Competitive Economy
- Measurable cardinals and analytic games
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On complexity properties of recursively enumerable sets
- On degrees of recursive unsolvability
- On degrees of unsolvability
- On effectively computable realizations of choice functions
- On the degrees less than 0'
- Prioric games and minimal degrees below $0^{(1)}$
- Recursive Real Numbers
- Recursive constructions in topological spaces
- Recursive metric spaces
- The minimum degree of recursively representable choice functions
- The recursively enumerable degrees are dense
Cited in
(6)- Game characterizations and lower cones in the Weihrauch degrees
- Game characterizations and lower cones in the Weihrauch degrees
- Weihrauch degrees of finding equilibria in sequential games
- A note on degrees of presentation of games as relational structures
- On the independence of core-equivalence results from Zermelo-Fraenkel set theory
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
This page was built for publication: Lower bounds on degrees of game-theoretic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106754)