Avoider-enforcer star games - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

Avoider-enforcer star games


In this paper, we study (1 : b) Avoider-Enforcer games played on the edge set of the complete graph on n vertices. For every constant k≥3 we analyse the k-star game, where Avoider tries to avoid claiming k edges incident to the same vertex. We consider both versions of Avoider-Enforcer games — the strict and the monotone — and for each provide explicit winning strategies for both players. We determine the order of magnitude of the threshold biases fmonF, f-F and f+F, where F is the hypergraph of the game.
Fichier principal
Vignette du fichier
dmtcs-17-1-10.pdf (314.81 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01196868 , version 1 (10-09-2015)



Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, et al.. Avoider-enforcer star games. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.145--160. ⟨10.46298/dmtcs.2124⟩. ⟨hal-01196868⟩


199 View
1059 Download



Gmail Facebook Twitter LinkedIn More