Winning strong games through fast strategies for weak games

Asaf Ferber; Dan Hefetz

doi:10.37236/631

Winning strong games through fast strategies for weak games

Asaf Ferber, Dan Hefetz

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

15 Scopus citations

Abstract

We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.

Original language	English
Journal	Electronic Journal of Combinatorics
Volume	18
Issue number	1
DOIs	https://doi.org/10.37236/631
State	Published - 2011
Externally published	Yes

Access to Document

10.37236/631

Cite this

@article{afc90b5c473e489495c736919043cd7b,

title = "Winning strong games through fast strategies for weak games",

abstract = "We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.",

author = "Asaf Ferber and Dan Hefetz",

year = "2011",

doi = "10.37236/631",

language = "אנגלית",

volume = "18",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1",

}

TY - JOUR

T1 - Winning strong games through fast strategies for weak games

AU - Ferber, Asaf

AU - Hefetz, Dan

PY - 2011

Y1 - 2011

N2 - We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.

AB - We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.

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

U2 - 10.37236/631

DO - 10.37236/631

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

AN - SCOPUS:79960684909

SN - 1077-8926

VL - 18

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

Winning strong games through fast strategies for weak games

Abstract

Access to Document

Other files and links

Fingerprint

Cite this