7 citations · 11 across the 8 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
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…
cs.DM2015
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…
cs.GT2015
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…