Recursively presented games and strategies

DOI10.1016/0165-4896(92)90059-EzbMath0786.90103MaRDI QIDQ1196205

Douglas Cenzer, Jeffery B. Remmel

Publication date: 16 December 1992

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

zbMATH Keywords

Gale-Stewart gameinfinite gamecomplexity of the set of winning strategiespolynomial time presented gamepolynomial time winning strategy

Mathematics Subject Classification ID

Multistage and repeated games (91A20)

Related Items

Weihrauch Degrees of Finding Equilibria in Sequential Games, On the lattices of NP-subspaces of a polynomial time vector space over a finite field, Complexity and categoricity, Feasibly categorical models, Game characterizations and lower cones in the Weihrauch degrees, The complexity of recursion theoretic games, Countable thin \(\Pi^0_1\) classes, Game characterizations and lower cones in the Weihrauch degrees, Complexity, decidability and completeness, Structural measures for games and process control in the branch learning model, Index sets in computable analysis, Feasible graphs with standard universe, Learning to win process-control games watching game-masters, Effectively closed sets and graphs of computable real functions.

Cites Work

• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Effective content of field theory
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item