AI Chat AI Image Generator AI Video Text to Speech

Optimal Strategies in Weighted Limit Games

09/23/2020

∙

by Aniello Murano, et al.

∙

∙

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.

Aniello Murano
24 publications
Sasha Rubin
13 publications
Martin Zimmermann
29 publications

page 1

page 2

page 3

page 4

research

∙ 08/26/2020

Optimal Strategies in Weighted Limit Games (full version)

We prove the existence and computability of optimal strategies in weight...

0 Aniello Murano, et al. ∙

research

∙ 04/29/2018

Concurrent games and semi-random determinacy

Consider concurrent, infinite duration, two-player win/lose games played...

0 Stephane Le Roux, et al. ∙

research

∙ 05/30/2022

Necessary and Sufficient Condition for the Existence of Zero-Determinant Strategies in Repeated Games

Zero-determinant strategies are a class of memory-one strategies in repe...

0 Masahiko Ueda, et al. ∙

research

∙ 07/02/2019

Energy mean-payoff games

In this paper, we study one-player and two-player energy mean-payoff gam...

0 Véronique Bruyère, et al. ∙

research

∙ 05/31/2023

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games (full version)

We compare games under delayed control and delay games, two types of inf...

0 Martin Fränzle, et al. ∙

research

∙ 04/12/2021

Kuhn's Equivalence Theorem for Games in Product Form

We propose an alternative to the tree representation of extensive form g...

0 Benjamin Heymann, et al. ∙