DeepAI AI Chat

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
23 publications
Sasha Rubin
12 publications
Martin Zimmermann
26 publications

page 1

page 2

page 3

page 4

∙ 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. ∙

∙ 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. ∙

∙ 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. ∙

∙ 05/03/2021

Playing Stochastically in Weighted Timed Games to Emulate Memory

Weighted timed games are two-player zero-sum games played in a timed aut...

0 Benjamin Monmege, et al. ∙

∙ 06/25/2019

A Compact, Logical Approach to Large-Market Analysis

In game theory, we often use infinite models to represent "limit" settin...

0 Yannai A. Gonczarowski, et al. ∙

∙ 12/23/2022

Adapting to game trees in zero-sum imperfect information games

Imperfect information games (IIG) are games in which each player only pa...

0 Côme Fiegel, et al. ∙

∙ 12/17/2018

Comparator automata in quantitative verification

The notion of comparison between system runs is fundamental in formal ve...

0 Suguman Bansal, et al. ∙