11 citations · 35 across the 15 of their papers we have counts for
9 papers · 1 filter
Parameterized Games and Parameterized Automata
Arno Pauly
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter va…
Extending finite-memory determinacy by Boolean combination of winning conditions
Stéphane Le Roux, Arno Pauly, Mickael Randour
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable control…
Beyond admissibility: Dominance between chains of strategies
Nicolas Basset, Ismaël Jecker, Arno Pauly +2
Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by resul…
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…