Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin (CoRR, 2018)

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin (GandALF, 2018)

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin; Marie van den Bogaard (CoRR, 2019)

On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games. - Thomas Brihaye; Aline Goeminne (FORMATS, 2020)

Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games. - Aline Goeminne (Inf. Process. Lett., 2020)

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin; Marie van den Bogaard (Log. Methods Comput. Sci., 2020)

Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin (Inf. Comput., 2021)

On relevant equilibria in reachability games. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Nathan Thomasset (J. Comput. Syst. Sci., 2021)

Non-blind Strategies in Timed Network Congestion Games. - Aline Goeminne; Nicolas Markey; Ocan Sankur (FORMATS, 2022)

Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). - Thomas Brihaye; Aline Goeminne; James C. A. Main; Mickael Randour (FSTTCS, 2023)

Multi-weighted Reachability Games. - Thomas Brihaye; Aline Goeminne (RP, 2023)

Enabling Decentralized Collaboration Among Transporters Through an Optimizing Trading Network for Transport Orders. - Renaud De Landtsheer; Aline Goeminne; Quentin Meurisse (IN4PL (2), 2024)

Permissive Equilibria in Multiplayer Reachability Games. - Aline Goeminne; Benjamin Monmege (CSL, 2025)