arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.01181cs.DS
收藏

支配博弈:在无孤立点的森林中证明3/5猜想

The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests

Neta Marcus, David Peleg

摘要:

我们分析了支配博弈,其中两个参与者,Dominator和Staller,在给定的图中通过交替选择顶点到M中来共同构造支配集M。每次移动都必须增加劣势集的大小。两个参与者有着相反的目标:支配者希望M尽可能小,而斯托勒则有着相反的目标。Kinnersley、West和Zamani指出,当两个参与者都在无孤立点的森林中进行最优博弈时,支配集的大小有一个保证的上限,它只取决于森林的大小n。当第一个玩家是Dominator时,这个界限是3 n/5,当第一个玩家是Staller时,这个界限是(3 n +2)/5。这个猜想由Kinnersley等人证明,后来由Bujtas扩展。在这里,我们证明它为所有孤立的森林,通过提供一个算法的支配者,保证所需的界限。

英文摘要:

We analyze the domination game, where two players, Dominator and Staller, construct together a dominating set M in a given graph, by alternately selecting vertices into M. Each move must increase the size of the dominated set. The players have opposing goals: Dominator wishes M to be as small as possible, and Staller has the opposite goal. Kinnersley, West and Zamani conjectured that when both players play optimally on an isolate-free forest, there is a guaranteed upper bound for the size of the dominating set that depends only on the size n of the forest. This bound is 3n/5 when the first player is Dominator, and (3n+2)/5 when the first player is Staller. The conjecture was proved for specific families of forests by Kinnersley et al. and later extended by Bujtas. Here we prove it for all isolate-free forests, by supplying an algorithm for Dominator that guarantees the desired bound.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑