Optimal Strategy Synthesis for Request-Response Games
classification
💻 cs.FL
cs.LO
keywords
gamesoptimalrequest-responseaccumulatedcasecomputabilityeffectiveexistence
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.