Optimal Strategy Synthesis for Request-Response Games
Formal Languages and Automata Theory
2014-06-19 v1 Logic in Computer Science
Abstract
We show the existence and effective computability of optimal winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.
Keywords
Cite
@article{arxiv.1406.4648,
title = {Optimal Strategy Synthesis for Request-Response Games},
author = {Florian Horn and Wolfgang Thomas and Nico Wallmeier and Martin Zimmermann},
journal= {arXiv preprint arXiv:1406.4648},
year = {2014}
}
Comments
The present paper is a revised version with simplified proofs of results announced in the conference paper of the same name presented at ATVA 2008, which in turn extended results of the third author's dissertation