activity
20122026
most citedGroupoid exactness and the weak containment problem

5 citations · 15 across the 16 of their papers we have counts for

collaborators

21 papers

cs.DM2026

Positional s-of-k games

Eric Duchêne, Valentin Gledel, Miloš Stojaković

We introduce a general framework for positional games in which players score points by claiming a prescribed portion of each winning set, extending the notion of scoring Maker-Brea…

math.CO2024

Partition strategies for the Maker-Breaker domination game

Guillaume Bagan, Eric Duchêne, Valentin Gledel +2

The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has…

math.CO2024

Poset Positional Games

Guillaume Bagan, Eric Duchêne, Florian Galliot +5

We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset…

math.CO2023

The Maker-Maker domination game in forests

Eric Duchêne, Arthur Dumas, Nacim Oijid +2

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 a domi…

cs.CC2023★ 2 cited

Complexity of Maker-Breaker Games on Edge Sets of Graphs

Eric Duchêne, Valentin Gledel, Fionn Mc Inerney +4

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

math.CO2022

Incidence, a Scoring Positional Game on Graphs

Guillaume Bagan, Quentin Deschamps, Eric Duchêne +5

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 hypergraph where…