Skip to Main content Skip to Navigation
Journal articles

Avoider-enforcer star games

Abstract : 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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, September 10, 2015 - 3:17:34 PM
Last modification on : Tuesday, November 26, 2019 - 4:12:09 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 12:03:41 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01196868, version 1



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, DMTCS, 2015, Vol. 17 no. 1 (in progress) (1), pp.145--160. ⟨hal-01196868⟩



Record views


Files downloads