The Complexity of Request-Response Games


We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form “if a state with property Rq is visited, then later a state with property Rp is visited”. The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that… (More)
DOI: 10.1007/978-3-642-21254-3_17


3 Figures and Tables


Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.