Combinatorial games: selected bibliography with a succinct gourmet introduction
A Fraenkel - The Electronic Journal of Combinatorics, 2012 - combinatorics.org
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
Coloring random graphs online without creating monochromatic subgraphs
Consider the following random process: The vertices of a binomial random graph Gn, p are
revealed one by one, and at each step only the edges induced by the already revealed …
revealed one by one, and at each step only the edges induced by the already revealed …
Combinatorial games
A Fraenkel - The Electronic Journal of Combinatorics, 2012 - emis.de
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
Probabilistic one-player Ramsey games via deterministic two-player games
M Belfrage, T Mütze, R Spöhel - SIAM Journal on Discrete Mathematics, 2012 - SIAM
Consider the following probabilistic one-player game: The board is a graph with n vertices,
which initially contains no edges. In each step, a new edge is drawn uniformly at random …
which initially contains no edges. In each step, a new edge is drawn uniformly at random …
[HTML][HTML] Proper colouring Painter–Builder game
M Bednarska-Bzdęga, M Krivelevich, V Mészáros… - Discrete …, 2018 - Elsevier
We consider the following two-player game, parametrised by positive integers n and k. The
game is played between Painter and Builder, alternately taking turns, with Painter moving …
game is played between Painter and Builder, alternately taking turns, with Painter moving …
[PDF][PDF] Ramsey games in random graphs
T Mütze - 2011 - research-collection.ethz.ch
Playing games has ever since been an important part of humans' social interaction, and over
the last centuries the theoretical analysis of games has fascinated and stimulated …
the last centuries the theoretical analysis of games has fascinated and stimulated …
[PDF][PDF] Coloring random graphs online without creating monochromatic subgraphs
TMTRR Spöhel - Citeseer
Consider the following random process: The vertices of a binomial random graph Gn, p are
revealed one by one, and at each step only the edges induced by the already revealed …
revealed one by one, and at each step only the edges induced by the already revealed …