Approximating the minimal lookahead needed to win infinite games

DOI10.1016/J.IPL.2022.106264OpenAlexW3094453991MaRDI QIDQ2671807

Martín G. Zimmermann

Publication date: 3 June 2022

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmformal methodsinfinite gamestheory of computationdelay games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata, logics, and infinite games. A guide to current research
• Finite-state strategies in delay games
• Degrees of Lookahead in Regular Infinite Games
• Deciding parity games in quasipolynomial time
• How Much Lookahead is Needed to Win Infinite Games?

This page was built for publication: Approximating the minimal lookahead needed to win infinite games