Determinancy with Complicated Strategies

DOI10.2307/2045400MaRDI QIDQ3715108zbMATH OpenOpenAlexFDO

Authors Alexander S. Kechris

Publication date 1985

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2045400

zbMATH Keywords

two person game on integers

Mathematics Subject Classification ID

Descriptive set theory (03E15) Determinacy principles (03E60)

Recommendations

• Unpredictability of complex (pure) strategies
• Determinateness of strategic games with a potential
• Deterministic strategy and stochastic programs
• Determinization and memoryless winning strategies
• Strategy machines and their complexity
• Strategic computation and deduction
• The Complexity of Eliminating Dominated Strategies
• Determinacy of games
• Strategic complexity in repeated extensive games
• Game theory and strategic complexity

Cited in

(10)

• How to make ambiguous strategies
• A trichotomy theorem in natural models of \(\text{AD}^+\)
• Game representations of classes of piecewise definable functions
• scientific article; zbMATH DE number 3865265 (Why is no real title available?)
• A Technique for Proving Uniformity
• An Unboundedness Property for Norms of Length ≥ω 2
• The axiom of determinateness implies ω_2 has precisely two countably complete, uniform, weakly normal ultrafilters
• Determinacy in the Mitchell models
• scientific article; zbMATH DE number 4066872 (Why is no real title available?)
• scientific article; zbMATH DE number 4072962 (Why is no real title available?)

This page was built for publication: Determinancy with Complicated Strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715108)