Optimal Strategies in Weighted Limit Games (full version)

2020/08/26 by Aniello Murano, Sasha Rubin, Murano, Aniello +4 · 1 citation
Computer Science · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.FL #cs.GT

paper · pdf · doi:10.48550/arxiv.2008.11562

openalex publication_date 2020/08/26 · arxiv created 2020/09/07 · arxiv updated 2020/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Optimal Strategies in Weighted Limit Games

Related

• Infinite-state games with finitary conditions
• A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff
• Optimal Strategy Synthesis for Request-Response Games
• Weighted automata on infinite words in the context of Attacker-Defender games
• Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games