101 citations · 491 across the 53 of their papers we have counts for
11 papers · 1 filter
On the existence of weak subgame perfect equilibria
Véronique Bruyère, Stéphane Le Roux, Arno Pauly +1
We study multi-player turn-based games played on (potentially infinite) directed graphs. An outcome is assigned to every play of the game. Each player has a preference relation on…
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract)
Stéphane Le Roux, Arno Pauly
We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and…
Minkowski games
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
We introduce and study Minkowski games. These are two player games, where the players take turns to chose positions in based on some rules. Variants include boundedn…
Extending Finite Memory Determinacy to Multiplayer Games
Stéphane Le Roux, Arno Pauly
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium…
Noetherian Quasi-Polish Spaces
Matthew de Brecht, Arno Pauly
In the presence of suitable power spaces, compactness of can be characterized as the singleton being open in the space of open subset…
Dividing by zero - how bad is it, really?
Takayuki Kihara, Arno Pauly
In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number w…