Approximating the minimal lookahead needed to win infinite games

DOI10.1016/J.IPL.2022.106264MaRDI QIDQ2671807zbMATH OpenOpenAlexFDO

Authors 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 algorithmdelay gamesformal methodsinfinite gamestheory of computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Automata, logics, and infinite games. A guide to current research
• Deciding parity games in quasipolynomial time
• Degrees of lookahead in regular infinite games
• Finite-state strategies in delay games
• How much lookahead is needed to win infinite games?
• scientific article; zbMATH DE number 7297873 (Why is no real title available?)
• scientific article; zbMATH DE number 3078993 (Why is no real title available?)
• Prompt delay

Cited in

(4)

• scientific article; zbMATH DE number 6486247 (Why is no real title available?)
• How Much Lookahead is Needed to Win Infinite Games?
• Strategies resilient to delay: games under delayed control vs. delay games
• On the existence of reactive strategies resilient to delay

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

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