Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/6722
Title: | Avoider-Enforcer star games | Authors: | Grzesik A. Mikalački (Rakić), Mirjana Nagy Z. Naor A. Patkós B. Skerman F. |
Issue Date: | 1-Jan-2015 | Journal: | Discrete Mathematics and Theoretical Computer Science | Abstract: | © 2015 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France. 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 jr is the hypergraph of the game. | URI: | https://open.uns.ac.rs/handle/123456789/6722 | ISSN: | 14627264 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on Feb 22, 2020
Page view(s)
19
Last Week
5
5
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.