arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1211.7258math.CO
收藏

相交族的博弈饱和度

Game saturation of intersecting families

Balazs Patkos, Mate Vizer

摘要:

我们考虑下面的组合游戏:两个玩家,快和慢,要求$k$ -元素子集的$[n]=\{1,2,...,n\}$交替,一个在每一个回合,这样两个玩家都被允许挑选集相交所有先前声称的子集。当不存在任何未声明的$k$ -满足所有已声明集合的子集时,游戏结束。游戏的分数是两名玩家所要求的盘数,快速的目的是尽可能保持低分数,而慢速的目的是尽可能推迟游戏的结束。游戏饱和数是当两个玩家根据最优策略玩游戏时的游戏得分。准确地说,我们必须区分两种情况,这取决于哪个玩家采取第一步。令$gsat_F(\mathbb{I}_{n,k})$和$gsat_S(\mathbb{I}_{n,k})$表示当两个玩家根据最优策略进行游戏并且游戏分别以Fast或Slow的移动开始时饱和游戏的得分。我们证明了$Ω_k(n^{k/3-5}) \le gsat_F(\mathbb{I}_{n,k}),gsat_S(\mathbb{I}_{n,k}) \le O_k(n^{k-\sqrt{k}/2})$成立。

英文摘要:

We consider the following combinatorial game: two players, Fast and Slow, claim $k$-element subsets of $[n]=\{1,2,...,n\}$ alternately, one at each turn, such that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed $k$-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone the game's end as long as possible. The game saturation number is the score of the game when both players play according to an optimal strategy. To be precise we have to distinguish two cases depending on which player takes the first move. Let $gsat_F(\mathbb{I}_{n,k})$ and $gsat_S(\mathbb{I}_{n,k})$ denote the score of the saturation game when both players play according to an optimal strategy and the game starts with Fast's or Slow's move, respectively. We prove that $Ω_k(n^{k/3-5}) \le gsat_F(\mathbb{I}_{n,k}),gsat_S(\mathbb{I}_{n,k}) \le O_k(n^{k-\sqrt{k}/2})$ holds.

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

↑