Avoider-Enforcer star games
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman · Scuola Normale Superiore eBooks · 2013
We study (1: b) Avoider-Enforcer games played on the edge set of the complete graph K n , on n vertices, where Avoider’s goal is to avoid claiming a copy of some small fixed graph G . In particular, we give explicit winning strategies for both players in the k -star game, where G is a K 1, k , for constant k ≥ 2 under both strict and monotone rules. We also give the winning strategies for both players in another two related monotone games. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.