In 2020, Costa et al. answered a long-standing open question, proposed by Bodlaender in
1991: the graph coloring game is PSPACE-complete. They also proved that the greedy …

Given a graph G and k∈ N, we introduce the following game played in G. Each round, Alice
colours an uncoloured vertex of G red, and then Bob colours one blue (if any remain). Once …

In the Maker-Breaker positional game, Maker and Breaker take turns picking vertices of a
hypergraph $ H $, and Maker wins if and only if he claims all the vertices of some edge of …

Avoidance games are games in which two players claim vertices of a hypergraph and try to
avoid some structures. These games are studied since the introduction of the game of SIM in …

Abstract We study the Maker–Maker version of the domination game introduced in 2018 by
Duchêne et al. Given a graph, two players alternately claim vertices. The first player to claim …

We initiate the study of the algorithmic complexity of Maker-Breaker games played on the
edge sets of general graphs. We mainly consider the perfect matching game and the $ H …

Positional games were introduced by Hales and Jewett in 1963, and their study became
more popular after Erdos and Selfridge's first result on their connection to Ramsey theory …

Positional games have been introduced by Hales and Jewett in 1963 and have been
extensively investigated in the literature since then. These games are played on a …

The Maker-Breaker resolving game is a game played on a graph $ G $ by Resolver and
Spoiler. The players taking turns alternately in which each player selects a not yet played …

In the Maker-Breaker domination game, Dominator and Staller play on a graph $ G $ by
taking turns in which each player selects a not yet played vertex of $ G $. Dominator's goal is …