Lower bounds on degrees of game-theoretic structures

DOI10.1016/0165-4896(88)90002-9zbMATH Open0651.90110OpenAlexW2051512972MaRDI QIDQ1106754FDOQ1106754

Authors: Alain A. Lewis 

Publication date: 1988

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(88)90002-9

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

zbMATH Keywords

unsolvabilityrecursive functionsTuring degreerelational structuresminimal degreesInfinite stage Gale-Stewart gamesN- person non-cooperative gamesprioric Banach-Mazur gamesSingle- player choice functionsWalrasian models of general equilibrium

Mathematics Subject Classification ID

Game theory (91A99) Computable structure theory, computable model theory (03C57) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Equilibrium points in n -person games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Existence of an Equilibrium for a Competitive Economy
• The recursively enumerable degrees are dense
• On Computable Numbers, with an Application to the Entscheidungsproblem
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On degrees of unsolvability
• Complexity of winning strategies
• Measurable cardinals and analytic games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Degrees of members of \(\Pi_ 1^ 0\) classes
• On the degrees less than 0'
• On degrees of recursive unsolvability
• Recursive Real Numbers
• On effectively computable realizations of choice functions
• Countable retracing functions and \(\Pi_2^0\) predicates
• Recursive metric spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Diagonalization in degree constructions
• Degrees of unsolvability: structure and theory
• Degrees of Computability
• Title not available (Why is that?)
• Recursive constructions in topological spaces
• The minimum degree of recursively representable choice functions
• On complexity properties of recursively enumerable sets
• Prioric games and minimal degrees below $0^{(1)}$
• Computational complexity of recursively enumerable sets
• Effective operations in a general setting

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)