Combinatorial games on graphs
type: Dataset
description: In this thesis, we study combinatorial games under differentconventions. A combinatorial game is a finite acyclic two-player game withcomplete information and no chance. First, we look at impartial gamesin normal play and in particular at the games VertexNim and Timber.Then, we consider partizan games in normal play, with results on the gamesTimbush, Toppling Dominoes and Col. Next, we look at all these gamesin misère play, and study misère games modulo the dicot universe and modulothe dead-ending universe. Finally, we talk about the domination game which,despite not being a combinatorial game, may be studied with combinatorialgames theory tools.
landing page: https://theses.hal.science/tel-00919998
identifier: NNT: 2013BOR14937
keyword: combinatorial-games
keyword: domination-game
keyword: graphes
keyword: graphs
keyword: impartial-games
keyword: infoeu-reposemanticsdoctoralthesis
keyword: infoinfo-ohcomputer-science-csother-csoh
keyword: jeux-combinatoires
keyword: jeux-de-domination
keyword: jeux-impartiaux
keyword: jeux-partisans
keyword: mathmath-gmmathematics-mathgeneral-mathematics-mathgm
keyword: misere-convention
keyword: normal-convention
keyword: partizan-games
keyword: theses
keyword: version-misere
keyword: version-normale
issued: 2026-05-07T18:38:29.290666
modified: 2026-05-07T18:38:29.290673
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Combinatorial games on graphs
type: Distribution
format: HTML
access URL: https://theses.hal.science/tel-00919998
issued: 2026-05-07T18:38:29.305781
modified: 2026-05-07T18:38:29.272972