构造者-阻断者博弈
The Constructor-Blocker Game
AI总结:
该研究提出广义图Turán问题的构造者-阻断者博弈模型,定义了最优策略下的得分函数$g(n,H,F)$,并针对多组特定图类得到了该函数的精确值、渐近性质及上下界。
摘要:
我们研究广义图Turán问题的如下博弈版本。给定两个固定图$F$和$H$,两名玩家——构造者(Constructor)与阻断者(Blocker)交替认领完全图$K_n$中未被认领的边。构造者只能认领满足以下条件的边:他永远不会认领任意一个$F$拷贝的全部边,即他的图必须始终保持无$F$($F$-free);而阻断者可以无限制地认领未被认领的边。当构造者无法再认领边,或所有边都已被认领时,博弈结束。博弈的得分是所有边均由构造者认领的$H$拷贝的数量。构造者的目标是最大化得分,阻断者则试图尽可能压低得分。我们用$g(n,H,F)$表示当两名玩家都采取最优策略且由构造者开局时的博弈得分。\n在本文中,我们得到了当$F$和$H$均为星图,以及当$F=P_4$、$H=P_3$时$g(n,H,F)$的精确值。我们确定了当$F$为星图且$H$为树,以及当$F=P_5$、$H=K_3$时$g(n,H,F)$的渐近行为,并推导了$g(n,P_4,P_5)$的上下界。
英文摘要:
We study the following game version of the generalized graph Turán problem. For two fixed graphs $F$ and $H$, two players, Constructor and Blocker, alternately claim unclaimed edges of the complete graph $K_n$. Constructor can only claim edges so that he never claims all edges of any copy of $F$, i.e. his graph must remain $F$-free, while Blocker can claim unclaimed edges without restrictions. The game ends when Constructor cannot claim further edges or when all edges have been claimed. The score of the game is the number of copies of $H$ with all edges claimed by Constructor. Constructor's aim is to maximize the score, while Blocker tries to keep the score as low as possible. We denote by $g(n,H,F)$ the score of the game when both players play optimally and Constructor starts the game. In this paper, we obtain the exact value of $g(n,H,F)$ when both $F$ and $H$ are stars and when $F=P_4$, $H=P_3$. We determine the asymptotics of $g(n,H,F)$ when $F$ is a star and $H$ is a tree and when $F=P_5$, $H=K_3$, and we derive upper and lower bounds on $g(n,P_4,P_5)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。