Fast winning strategies in avoider-enforcer games

Dan Hefetz; Michael Krivelevich; Miloš Stojaković; Tibor Szabó

doi:10.1007/s00373-009-0870-8

Fast winning strategies in avoider-enforcer games

Dan Hefetz, Michael Krivelevich, Miloš Stojaković, Tibor Szabó

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

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 K_n 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.

Original language	English
Pages (from-to)	533-544
Number of pages	12
Journal	Graphs and Combinatorics
Volume	25
Issue number	4
DOIs	https://doi.org/10.1007/s00373-009-0870-8
State	Published - Dec 2009
Externally published	Yes

Keywords

Bipartite
Connectivity
Planarity

Access to Document

10.1007/s00373-009-0870-8

Cite this

@article{c1d89ca55ac845b787a9c61c1a8983bd,

title = "Fast winning strategies in avoider-enforcer games",

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.",

keywords = "Bipartite, Connectivity, Planarity",

author = "Dan Hefetz and Michael Krivelevich and Milo{\v s} Stojakovi{\'c} and Tibor Szab{\'o}",

note = "Funding Information: Michael Krivelevich: Research supported in part by a USA-Israel BSF grant, a grant from the Israel Science Foundation and by a Pazy Memorial Award. Funding Information: Milo{\v s} Stojakovi{\'c}: Partially supported by the Ministry of Science, Republic of Serbia, and Provincial Secretariat for Science, Province of Vojvodina.",

year = "2009",

month = dec,

doi = "10.1007/s00373-009-0870-8",

language = "אנגלית",

volume = "25",

pages = "533--544",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "4",

}

TY - JOUR

T1 - Fast winning strategies in avoider-enforcer games

AU - Hefetz, Dan

AU - Krivelevich, Michael

AU - Stojaković, Miloš

AU - Szabó, Tibor

N1 - Funding Information: Michael Krivelevich: Research supported in part by a USA-Israel BSF grant, a grant from the Israel Science Foundation and by a Pazy Memorial Award. Funding Information: Miloš Stojaković: Partially supported by the Ministry of Science, Republic of Serbia, and Provincial Secretariat for Science, Province of Vojvodina.

PY - 2009/12

Y1 - 2009/12

N2 - 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.

AB - 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.

KW - Bipartite

KW - Connectivity

KW - Planarity

UR - http://www.scopus.com/inward/record.url?scp=72049088305&partnerID=8YFLogxK

U2 - 10.1007/s00373-009-0870-8

DO - 10.1007/s00373-009-0870-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:72049088305

SN - 0911-0119

VL - 25

SP - 533

EP - 544

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 4

ER -

Fast winning strategies in avoider-enforcer games

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this