ar X iv : 1 40 6 . 46 48 v 1 [ cs . F L ] 1 8 Ju n 20 14 Optimal Strategy Synthesis for Request - Response Games ∗ Florian Horn
نویسنده
چکیده
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.
منابع مشابه
ar X iv : 0 70 6 . 26 19 v 1 [ cs . L O ] 1 8 Ju n 20 07 Algorithms for Omega - Regular Games with Imperfect Information ∗
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fi...
متن کاملExact Learning from an Honest Teacher That Answers Membership Queries
Given a teacher that holds a function f : X → R from some class of functions C. The teacher can receive from the learner an element d in the domain X (a query) and returns the value of the function in d, f(d) ∈ R. The learner goal is to find f with a minimum number of queries, optimal time complexity, and optimal resources. In this survey, we present some of the results known from the literatur...
متن کامل