Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/10855
Nаziv: | Avoider-Enforcer: The rules of the game | Аutоri: | Hefetz D. Krivelevich M. Stojaković, Miloš Szabó T. |
Dаtum izdаvаnjа: | 1-феб-2010 | Čаsоpis: | Journal of Combinatorial Theory. Series A | Sažetak: | An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X. The players claim previously unoccupied elements of the board X in turns. Enforcer wins if Avoider claims all vertices of some element of F, otherwise Avoider wins. In a more general version of the game a bias b is introduced to level up the players' chances of winning; Avoider claims one element of the board in each of his moves, while Enforcer responds by claiming b elements. This traditional set of rules for Avoider-Enforcer games is known to have a shortcoming: it is not bias monotone. We relax the traditional rules in a rather natural way to obtain bias monotonicity. We analyze this new set of rules and compare it with the traditional ones to conclude some surprising results. In particular, we show that under the new rules the threshold bias for both the connectivity and Hamiltonicity games, played on the edge set of the complete graph Kn, is asymptotically equal to n / log n. This coincides with the asymptotic threshold bias of the same game played by two "random" players. © 2009 Elsevier Inc. All rights reserved. | URI: | https://open.uns.ac.rs/handle/123456789/10855 | ISSN: | 00973165 | DOI: | 10.1016/j.jcta.2009.05.001 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
18
prоvеrеnо 12.08.2023.
Prеglеd/i stаnicа
14
Prоtеklа nеdеljа
12
12
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.