arXiv 1503.028852015-03-10math.CO

A remark on the Tournament game

Dennis Clemens, Mirjana Mikalački

发表信息：: The Electronic Journal of Combinatorics 22(3) (2015), P3.42

英文摘要：

We study the Maker-Breaker tournament game played on the edge set of a given graph $G$. Two players, Maker and Breaker claim unclaimed edges of $G$ in turns, and Maker wins if by the end of the game she claims all the edges of a pre-defined goal tournament. Given a tournament $T_k$ on $k$ vertices, we determine the threshold bias for the $(1:b)$ $T_k$-tournament game on $K_n$. We also look at the $(1:1)$ $T_k$-tournament game played on the edge set of a random graph ${\mathcal{G}_{n,p}}$ and determine the threshold probability for Maker's win. We compare these games with the clique game and discuss whether a random graph intuition is satisfied.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

tournaments 的 Schuttes 性质及在骰子游戏中的应用

Schuttes property for sets of tournaments and an application to dice games

Iowa State University（爱荷华州立大学）

研究了 tournaments 的 Schuttes 性质的推广，探讨了 m 个 tournaments 需要的最少顶点数，并应用于设计新的骰子游戏。

2026-04-09math.CO

Biased orientation games

We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker wins if the tournament has some property $\mathcal P$ and Breaker wins otherwise. We provide bounds on the bias that is required for a Maker's win and for a Breaker's win in three different games. In the first game Maker wins if the obtained tournament has a cycle. The second game is Hamiltonicity, where Maker wins if the obtained tournament contains a Hamilt…

2011-07-10math.CO

The random graph intuition for the tournament game

In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two possible orientations. Before the game starts, Breaker fixes an arbitrary tournament T_k on k vertices. Maker wins if, at the end of the game, her digraph contains a copy of T_k; otherwise Breaker wins. In our main result, we show that Maker has a winning strategy for k = (2-o(1))log_2 n, improving the constant factor in previous results of Beck and the second author. This is asymptotically tight since it is known th…

2013-07-16math.CO

Rock, Paper, Scissors, Etc -- Topics in the Theory of Regular Tournaments

The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments where each strategy beats and is beaten by exactly half of the alternatives. We survey the properties of regular tournaments, which we will call games. In the process we describe a number of constructions for such games. These include games on groups of odd order and the associated games on coset spaces. We obtain a new lower bound for the number of games of…

2020-08-23math.COmath.DS

The Localization Game on Directed Graphs

In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main parameter, the localization number, to directed graphs. We present several bounds on the localization number of a directed graphs, including a tight bound via strong components, a bound using a linear programming problem on hypergraphs, and bounds in terms of pathwidth and DAG-width. A family of digraphs of order $n$ is given with localization number $(1-o(1))n/2$. We investigate the localization number of random and qua…

2022-08-16math.CO

Erratum to: "Remarks on the second neighborhood problem"

We prove that the proof of existence of weighted local median order of weighted tournaments is wrong and that the proof of the correct statement which asserts that every digraph obtained from a tournament by deleting a set of arcs incident to the same vertex contains a mistake, in the paper entitled "Remarks on the second neighborhood problem". We introduce correct proofs of each.

2015-06-12math.CO

更多相关论文收起更多论文

Coxeter交换图

Coxeter interchange graphs

本文引入Coxeter交换图，其顶点代表Coxeter竞赛图，边对应中性结构的操作；证明该图是正则的并几何描述其度数，还刻画了Coxeter竞赛图的得分序列集，推广Landau经典结果。

2024-10-30math.CO

Coxeter锦标赛

Coxeter tournaments

该研究用随机Coxeter锦标赛描述Coxeter置换多面体，建立了Moon定理的Coxeter版本，给出三种不同证明并引入Bradley–Terry模型的Coxeter类似物。

2025-08-01math.COmath.PR

定向三角游戏的制作者-破坏者游戏

The Maker-Breaker directed triangle game

Eindhoven University of Technology（埃因霍温理工大学）；Indian Institute of Science Education and Research, Pune（印度科学教育研究所浦那分校）

本文研究了定向三角制作者-破坏者游戏，分析了在奇数 tournaments 上的阈值和随机 tournaments 上的获胜策略，以及引入了翻转偏置机制。

2026-04-16math.COmath.PR

Coxeter交换图上的随机游走

Random walks on Coxeter interchange graphs

本文研究Zaslavsky符号图上的Coxeter竞赛图对应的交换图随机游走，通过路径耦合方法结合度量重加权证明其快速混合，并探讨其与Coxeter置换多面体的几何关联。

2025-01-28math.COmath.PR

石头剪刀布变体的纳什均衡

Nash Equilibria of Rock Paper Scissors Variants

本文将石头剪刀布推广为 n 顶点锦标赛图，研究其混合策略纳什均衡的图论性质，并对 n ≤ 7 的情况进行列表整理。

2024-10-16math.CO

The Tournament Scheduling Problem with Absences

We study time scheduling problems with allowed absences as a new kind of graph coloring problem. One may think of a sport tournament where each player (each team) is permitted a certain number $t$ of absences. We then examine how many rounds are needed to schedule the whole tournament in the worst case. This upper limit depends on $t$ and on the structure of the graph $G$ whose edges represent the games that have to be played, but also on whether or not the absences are announced before the tournament starts. Therefore, we actually have two upper limits for the number of required rounds. We ha…

2016-05-20math.CO

Some remarks on the Game of Cycles

The Game of Cycles is an impartial game on a planar graph that was introduced by Francis Su. In this short note we address some questions that have been raised on the game, and raise some further questions.

2023-03-15math.CO

高度结构化有向图族的定位与度量维数

Localization and metric dimension for families of highly structured digraphs

Memorial University（纪念大学）

研究强正则图及其推广的有向类似图族的度量维数和定位博弈，采用概率方法，得出定位数和度量维数上界，给出特定有向图族的相关结果。

2026-07-07math.CO

有向图上警察与小偷博弈的复杂性结论

Complexity results for a cops and robber game on directed graphs

该研究探究有向图警察与小偷博弈的警察数复杂性，证明单警察判定的NP难性与竞赛图的多项式可判定性，给出不同参数下的固定参数可处理性结论，并建立与反向图、矩阵死亡率问题的关联。

2024-10-07cs.CCcs.DMmath.CO

A non-trivial upper bound on the threshold bias of the Oriented-cycle game

In the Oriented-cycle game, introduced by Bollobás and Szabó, two players, called OMaker and OBreaker, alternately direct edges of $K_n$. OMaker directs exactly one edge, whereas OBreaker is allowed to direct between one and $b$ edges. OMaker wins if the final tournament contains a directed cycle, otherwise OBreaker wins. Bollobás and Szabó conjectured that for a bias as large as $n-3$ OMaker has a winning strategy if OBreaker must take exactly $b$ edges in each round. It was shown recently by Ben-Eliezer, Krivelevich and Sudakov, that OMaker has a winning strategy for this game whenever $b\le…

2016-05-18math.CO

有向图上的灯光熄灭游戏

The Lights Out Game on Directed Graphs

Grand Valley State University（大急流城州立大学）

研究了有向图上的灯光熄灭游戏，证明了所有无环图在任意k下均可赢，并分析了竞赛图的可赢性条件。

2023-06-09math.CO

Some Game Theoretic Remarks on Two-Player Generalized Cops and Robbers Games

In this paper we study the two-player generalized Cops and Robber (GCR) games introduced by Bonato and MacGillivray. Our main goal is to present a full, self-contained game theoretic analysis of such games.

2020-11-19cs.DMcs.GTmath.CO

有向圈博弈阈值偏差的一个改进上界

An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game

School of Mathematics and Statistics, UNSW Sydney（新南威尔士大学数学与统计学院）；Potassco Solutions

研究有向圈博弈中造图者获胜的最大偏差b值问题，受前人启发为破图者提出更强策略，证明该策略能使破图者在$b \geq 0.7841n + O(1)$时获胜。

2026-07-17math.CO

Some remarks on cops and drunk robbers

Aristotle University of Thessaloniki（亚里士多德大学）；Ryerson University（瑞尔森大学）

The cops and robbers game has been extensively studied under the assumption of optimal play by both the cops and the robbers. In this paper we study the problem in which cops are chasing a drunk robber (that is, a robber who performs a random walk) on a graph. Our main goal is to characterize the "cost of drunkenness." Specifically, we study the ratio of expected capture times for the optimal version and the drunk robber one. We also examine the algorithmic side of the problem; that is, how to compute near-optimal search schedules for the cops. Finally, we present a preliminary investigation o…

2011-06-13cs.DMcs.GTcs.RO