Effective strategies for enumeration games

DOI10.1007/3-540-61377-3_49MaRDI QIDQ6560179zbMATHFDO

Authors Martin Kummer, Matthias Ott

Publication date 21 June 2024

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Combinatorial games (91A46) Applications of computability and recursion theory (03D80) Algorithmic game theory and complexity (91A68)

Recommendations

• The complexity of recursion theoretic games
• Recursively presented games and strategies
• On the synthesis of strategies in infinite games
• scientific article; zbMATH DE number 2077117
• Infinite games specified by 2-tape automata

Cites work

• scientific article; zbMATH DE number 4180791 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 65755 (Why is no real title available?)
• scientific article; zbMATH DE number 177246 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 4114620 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• Classical recursion theory. The theory of functions and sets of natural numbers
• Complexity of winning strategies
• Infinite games played on finite graphs
• On some games which are relevant to the theory of recursively enumerable sets
• On the synthesis of discrete controllers for timed systems
• On the synthesis of strategies in infinite games
• Solving Sequential Conditions by Finite-State Strategies
• Supervision of Infinite Behavior of Discrete-Event Systems

This page was built for publication: Effective strategies for enumeration games

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