On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games

TL;DR

This paper investigates the computational complexity of finding subgame perfect equilibria in multiplayer turn-based timed games with reachability objectives, establishing that the problem is EXPTIME-complete.

Contribution

It proves that deciding the constrained existence of an SPE in such timed games is EXPTIME-complete, advancing understanding of their computational complexity.

Findings

Deciding the existence of an SPE is EXPTIME-complete.

The study focuses on multiplayer turn-based timed games with reachability objectives.

Provides complexity classification for SPE existence in timed games.

Abstract

We study multiplayer turn-based timed games with reachability objectives. In particular, we are interested in the notion of subgame perfect equilibrium (SPE). We prove that deciding the constrained existence of an SPE in this setting is EXPTIME-complete.