| Issue |
RAIRO-Theor. Inf. Appl.
Volume 49, Number 3, July-September 2015
|
|
|---|---|---|
| Page(s) | 179 - 203 | |
| DOI | https://doi.org/10.1051/ita/2015005 | |
| Published online | 08 October 2015 | |
Optimal strategy synthesis for request-response games∗
1 LIAFA, Université Denis Diderot -
Paris 7, 75205
Paris cedex 13,
France.
This email address is being protected from spambots. You need JavaScript enabled to view it.
2 Lehrstuhl für Informatik 7, RWTH
Aachen University, 52056
Aachen,
Germany.
This email address is being protected from spambots. You need JavaScript enabled to view it.
This email address is being protected from spambots. You need JavaScript enabled to view it.
3 Reactive Systems Group, Saarland
University, 66123
Saarbrücken,
Germany.
This email address is being protected from spambots. You need JavaScript enabled to view it.
Received:
18
June
2014
Accepted:
3
August
2015
Abstract
We show the existence and effective computability of optimal (even finite-state) 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.
Mathematics Subject Classification: 68Q45
Key words: Request-response games / optimal strategies / mean-payoff games
Research partially supported by ANR AVERISS, by the DFG Research Training Group 1298 “AlgoSyn”, by the “CASSTING” project funded by the European Commission’s 7th Framework Programme, and by the DFG projects “TriCS” (ZI 1516/1-1) and “AVACS” (SFB/TR 14).
© EDP Sciences 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.