Fast winning strategies in avoider-enforcer games

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

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

6 اقتباسات (Scopus)

ملخص

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.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)533-544
عدد الصفحات12
دوريةGraphs and Combinatorics
مستوى الصوت25
رقم الإصدار4
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - ديسمبر 2009
منشور خارجيًانعم

بصمة

أدرس بدقة موضوعات البحث “Fast winning strategies in avoider-enforcer games'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا