Optimal Strategies in Weighted Limit Games (full version)
Aniello Murano, Sasha Rubin, Martin Zimmermann
TL;DR
This paper establishes the existence and computability of optimal strategies in weighted limit games, a class of infinite-duration games with regular winning conditions, focusing on maximizing infix weights between winning prefixes.
Contribution
It introduces a framework for computing optimal strategies in weighted limit games with B"uchi-style conditions, advancing understanding of infinite-duration game strategies.
Findings
Proves existence of optimal strategies in weighted limit games.
Provides algorithms for computing these strategies.
Analyzes the maximal weight of infixes between winning prefixes.
Abstract
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Logic, Reasoning, and Knowledge