AI Chat AI Image Generator AI Video Text to Speech

On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games

06/18/2020

∙

by Thomas Brihaye, et al.

∙

∙

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.

Thomas Brihaye
17 publications
Aline Goeminne
8 publications

page 1

page 2

page 3

page 4

research

∙ 06/14/2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives

We study multiplayer turn-based games played on a finite directed graph ...

0 Thomas Brihaye, et al. ∙

research

∙ 09/10/2018

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives

We study multiplayer turn-based games played on a finite directed graph ...

0 Thomas Brihaye, et al. ∙

research

∙ 05/02/2019

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)

We study multiplayer quantitative reachability games played on a finite ...

0 Thomas Brihaye, et al. ∙

research

∙ 06/14/2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives (full version)

We study multiplayer turn-based games played on a finite directed graph ...

0 Thomas Brihaye, et al. ∙

research

∙ 01/30/2023

Rational verification and checking for Nash and subgame-perfect equilibria in graph games

We study two natural problems about rational behaviors in multiplayer no...

0 Léonard Brice, et al. ∙

research

∙ 08/03/2018

The Complexity of Sequential Routing Games

We study routing games where every agent sequentially decides her next e...

0 Anisse Ismaili, et al. ∙

research

∙ 03/02/2022

Reachability of turn sequences

A turn sequence of left and right turns is realized as a simple rectilin...

0 William S. Evans, et al. ∙