Optimal Strategies in Weighted Limit Games (full version)
Computer Science and Game Theory
2020-09-08 v2 Formal Languages and Automata Theory
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.
Keywords
Cite
@article{arxiv.2008.11562,
title = {Optimal Strategies in Weighted Limit Games (full version)},
author = {Aniello Murano and Sasha Rubin and Martin Zimmermann},
journal= {arXiv preprint arXiv:2008.11562},
year = {2020}
}