  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.
