Avoider-Enforcer star games
Grzesik, Andrzej · Mikalački, Mirjana · Nagy, Zoltán Lóránt · Naor, Alon · Patkós, Balázs · Skerman, Fiona
Original · EN
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 analyse 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.