Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/11738
Title: | Fast winning strategies in avoider-enforcer games | Authors: | Hefetz D. Krivelevich M. Stojaković M. Szabó T. |
Issue Date: | 1-Dec-2009 | Journal: | Graphs and Combinatorics | Abstract: | In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. These types of problems were studied earlier for Maker-Breaker games; here we initiate their study for unbiased Avoider-Enforcer games played on the edge set of the complete graph Kn on n vertices. For several games that are known to be an Enforcer's win, we estimate quite precisely the minimum number of moves Enforcer has to play in order to win. We consider the non-planarity game, the connectivity game and the non-bipartite game. © 2009 Springer-Verlag 2009. | URI: | https://open.uns.ac.rs/handle/123456789/11738 | ISSN: | 09110119 | DOI: | 10.1007/s00373-009-0870-8 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
6
checked on Jul 1, 2023
Page view(s)
4
Last Week
1
1
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.