2020/09/23 by Aniello Murano, Sasha Rubin, Martin Zimmermann
Computer Science · #cs.GT #cs.FL
paper · pdf · doi:10.4204/eptcs.326.8
published as EPTCS 326, 2020, pp. 114-130 · In Proceedings GandALF 2020, arXiv:2009.09360. Full version at arXiv:2008.11562
arxiv created 2020/09/23 · arxiv updated 2020/09/25
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a Büchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular specification. Quality of plays is measured in the maximal weight of infixes between successive play prefixes that satisfy the specification.