Optimal Strategy Synthesis for Request-Response Games

TL;DR

This paper establishes the existence and computability of optimal strategies in request-response games based on minimizing the long-term average waiting times between requests and responses.

Contribution

It introduces a method to synthesize optimal strategies for request-response games considering mean waiting times, which was not previously addressed.

Findings

Optimal strategies exist for the specified game model.

These strategies can be effectively computed.

The approach focuses on limit superior of mean waiting times.

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.