The Speed and Threshold of the Biased Perfect Matching Game

Noah Brustle,Sarah Clusiau,Vishnu V. Narayan,Ndiamé Ndiaye,Bruce Reed,Ben Seamone

PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM（2021）

引用 1|浏览7

暂无评分

摘要

We show Maker wins the Maker-Breaker perfect matching game in n/2 + o(n) turns when the bias is at least n/ln n - f(n)n/(ln n)(5/4), for' for any f going to infinity with n and n sufficiently large (in terms of f). (C) 2021 The Authors. Published by Elsevier B.V.

查看译文

关键词

Maker-Breaker games, Perfect matching game, Threshold bias

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要