How Much Lookahead is Needed to Win Infinite Games?

DOI10.1007/978-3-662-47666-6_36zbMath1440.68125arXiv1412.3701OpenAlexW2963581588MaRDI QIDQ5899477

Felix Klein, Martín G. Zimmermann

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3701

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic game theory and complexity (91A68)

Related Items (5)

Delay Games with WMSO$$+$$U Winning Conditions ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ Infinite-Duration Bidding Games

Cites Work

• Unnamed Item
• Unnamed Item
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Degrees of Lookahead in Context-free Infinite Games
• Degrees of Lookahead in Regular Infinite Games
• Delay Games with WMSO$$+$$U Winning Conditions
• Rabin's uniformization problem
• MSO on the Infinite Binary Tree: Choice and Order
• Alternation
• What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
• Solving Parity Games in Big Steps
• Solving Sequential Conditions by Finite-State Strategies
• How Much Lookahead is Needed to Win Infinite Games?

This page was built for publication: How Much Lookahead is Needed to Win Infinite Games?