Avoider-Enforcer star games

Fiona Skerman, Andrzej Grzesik, Mirjana Mikalački , Zoltán Nagy, Alon Noar, Balázs Patkós

Research output: Contribution to journalArticle (Academic Journal)peer-review

1 Citation (Scopus)
182 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)145-160
Number of pages6
JournalDiscrete Mathematics and Theoretical Computer Science
Volume17
Issue number1
Publication statusPublished - Apr 2015

Keywords

  • positional games
  • avoider-enforcer
  • star graph

Fingerprint Dive into the research topics of 'Avoider-Enforcer star games'. Together they form a unique fingerprint.

Cite this