7 citations · 11 across the 8 of their papers we have counts for
10 papers
Progress on misère dead ends: game comparison, canonical form, and conjugate inverses
Urban Larsson, Rebecca Milley, Richard Nowakowski +2
This paper addresses several significant gaps in the theory of restricted misère play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathca…
Maker-Breaker domination game
Eric Duchêne, Valentin Gledel, Aline Parreau +1
We introduce the Maker-Breaker domination game, a two player game on a graph. At his turn, the first player, Dominator, select a vertex in order to dominate the graph while the oth…
Restricted developments in partizan misere game theory
Rebecca Milley, Gabriel Renault
Much progress has been made in misere game theory using the technique of restricted misere play, where games can be considered equivalent inside a restricted set of games without b…
Complexity of the Game Domination Problem
Boštjan Brešar, Paul Dorbec, Sandi Klavžar +2
The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph colo…
Invertibility modulo dead-ending no-P-universes
Gabriel Renault
In normal version of combinatorial game theory, all games are invertible, whereas only the empty game is invertible in misère version. For this reason, several restricted universes…
Quantitative Games under Failures
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +3
We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does…
Binary dicots, a core of dicot games
Gabriel Renault
We study combinatorial games under misère convention. Several sets of games have been considered earlier to better understand the behaviour of misère games. We here connect several…
On the Complexity of the Misère Version of Three Games Played on Graphs
Gabriel Renault, Simon Schmidt
We investigate the complexity of finding a winning strategy for the misère version of three games played on graphs : two variants of the game , introduced by Stockmann…
Dead Ends in Misere Play: The Misere Monoid of Canonical Numbers
Rebecca Milley, Gabriel Renault
We find the misere monoids of normal-play canonical-form integer and non-integer numbers. These come as consequences of more general results for the universe of `dead-ending' games…
Vertex Nim played on graphs
Eric Duchêne, Gabriel Renault
Given a graph G with positive integer weights on the vertices, and a token placed on some current vertex u, two players alternately remove a positive integer weight from u and then…