arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.19949math.CO
收藏

建造者-阻挡者一般位置博弈

Builder-Blocker General Position Games

Sandi Klavžar, Jing Tian, James Tuite

AI总结:

本文研究一般位置问题的对抗博弈版本,确定建造者与阻挡者轮流添加顶点时的博弈一般位置数,给出常见图类及树的精确界,并分析玩家顺序的影响。

摘要:

本文考虑了图的一般位置问题的一个博弈版本,其中一般位置集合通过对抗性游戏来构建。图中的两个玩家,建造者(Builder)和阻挡者(Blocker),轮流向一个集合中添加顶点,使得该集合中的顶点始终处于一般位置。建造者的目标是创建一个尽可能大的一般位置集合,而阻挡者的目标是通过使集合尽可能小来挫败建造者的计划。当无法再添加顶点而不产生三点共线时,游戏结束,此时集合中的顶点数称为博弈一般位置数。我们确定了一些常见图类的这个数,并给出了精确的界,特别是对于树的情形。我们还讨论了改变玩家先后顺序所带来的影响。

英文摘要:

This paper considers a game version of the general position problem in which a general position set is built through adversarial play. Two players in a graph, Builder and Blocker, take it in turns to add a vertex to a set, such that the vertices of this set are always in general position. The goal of Builder is to create a large general position set, whilst the aim of Blocker is to frustrate Builder's plans by making the set as small as possible. The game finishes when no further vertices can be added without creating three-in-a-line and the number of vertices in this set is the game general position number. We determine this number for some common graph classes and provide sharp bounds, in particular for the case of trees. We also discuss the effect of changing the order of the players.

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

↑