Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Renault, Gabriel"'
This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves in $X\in
Externí odkaz:
http://arxiv.org/abs/1807.11297
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 other player, Staller, forbids a vertex to Dominator in order to prevent
Externí odkaz:
http://arxiv.org/abs/1807.09479
Autor:
Milley, Rebecca, Renault, Gabriel
Publikováno v:
In Discrete Mathematics December 2022 345(12)
Autor:
Milley, Rebecca, Renault, Gabriel
Publikováno v:
in U. Larsson (Ed.) Games of No Chance 5, MSRI Book Series 70, Cambridge University Press, Massachusettes (2019), 113-123
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 being equal in general. This paper provides a survey of recent results
Externí odkaz:
http://arxiv.org/abs/1606.07362
Autor:
Renault, Gabriel
Dans cette thèse, nous étudions les jeux combinatoires sousdifférentes contraintes. Un jeu combinatoire est un jeu à deux joueurs, sanshasard, avec information complète et fini acyclique. D’abord, nous regardonsles jeux impartiaux en version n
Externí odkaz:
http://www.theses.fr/2013BOR14937/document
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 coloring. In this paper we show that verifying whether the game domination
Externí odkaz:
http://arxiv.org/abs/1510.00140
Autor:
Renault, Gabriel
In normal version of combinatorial game theory, all games are invertible, whereas only the empty game is invertible in mis\`ere version. For this reason, several restricted universes were earlier considered for their study, in which more games are in
Externí odkaz:
http://arxiv.org/abs/1509.01576
Autor:
Brihaye, Thomas, Geeraerts, Gilles, Haddad, Axel, Monmege, Benjamin, Pérez, Guillermo A., Renault, Gabriel
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 not allow one to model infinite processes. We propose an extension of
Externí odkaz:
http://arxiv.org/abs/1504.06744
Autor:
Renault, Gabriel
We study combinatorial games under mis\`ere convention. Several sets of games have been considered earlier to better understand the behaviour of mis\`ere games. We here connect several of these sets. In particular, we prove that comparison modulo bin
Externí odkaz:
http://arxiv.org/abs/1405.3036
Autor:
Renault, Gabriel, Schmidt, Simon
We investigate the complexity of finding a winning strategy for the mis\`ere version of three games played on graphs : two variants of the game $\text{NimG}$, introduced by Stockmann in 2004 and the game $\text{Vertex Geography}$ on both directed and
Externí odkaz:
http://arxiv.org/abs/1401.0400