在线匹配不允许\(o(\sqrt {\log n})\) -竞争算法

IF 0.9 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS ACM Transactions on Algorithms Pub Date : 2023-07-14 DOI:https://dl.acm.org/doi/10.1145/3594873

Enoch Peserico, Michele Scquizzato

{"title":"在线匹配不允许\\(o(\\sqrt {\\log n})\\) -竞争算法","authors":"Enoch Peserico, Michele Scquizzato","doi":"https://dl.acm.org/doi/10.1145/3594873","DOIUrl":null,"url":null,"abstract":"We present a simple proof that no randomized online matching algorithm for the line can be \\((\\sqrt {\\log _2(n+1)}/15)\\)-competitive against an oblivious adversary for any n = 2i - 1 : i ∈ ℕ. This is the first super-constant lower bound for the problem, and disproves as a corollary a recent conjecture on the topology-parametrized competitiveness achievable on generic spaces.","PeriodicalId":50922,"journal":{"name":"ACM Transactions on Algorithms","volume":"7 15","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Matching on the Line Admits no \\\\(o(\\\\sqrt {\\\\log n})\\\\) -Competitive Algorithm\",\"authors\":\"Enoch Peserico, Michele Scquizzato\",\"doi\":\"https://dl.acm.org/doi/10.1145/3594873\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a simple proof that no randomized online matching algorithm for the line can be \\\\((\\\\sqrt {\\\\log _2(n+1)}/15)\\\\)-competitive against an oblivious adversary for any n = 2i - 1 : i ∈ ℕ. This is the first super-constant lower bound for the problem, and disproves as a corollary a recent conjecture on the topology-parametrized competitiveness achievable on generic spaces.\",\"PeriodicalId\":50922,\"journal\":{\"name\":\"ACM Transactions on Algorithms\",\"volume\":\"7 15\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Algorithms\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/https://dl.acm.org/doi/10.1145/3594873\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Algorithms","FirstCategoryId":"94","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3594873","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

我们给出了一个简单的证明，对于任意n = 2i - 1: i∈n，没有任何随机在线匹配算法可以与遗忘对手\((\sqrt {\log _2(n+1)}/15)\)竞争。这是该问题的第一个超常数下界，并作为一个推论否定了最近关于在一般空间上可实现的拓扑参数化竞争的猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm

We present a simple proof that no randomized online matching algorithm for the line can be \((\sqrt {\log _2(n+1)}/15)\)-competitive against an oblivious adversary for any n = 2ⁱ - 1 : i ∈ ℕ. This is the first super-constant lower bound for the problem, and disproves as a corollary a recent conjecture on the topology-parametrized competitiveness achievable on generic spaces.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Transactions on Algorithms COMPUTER SCIENCE, THEORY & METHODS-MATHEMATICS, APPLIED

CiteScore

3.30

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： ACM Transactions on Algorithms welcomes submissions of original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis. Most welcome are new algorithms and data structures, new and improved analyses, and complexity results. Specific areas of computation covered by the journal include combinatorial searches and objects; counting; discrete optimization and approximation; randomization and quantum computation; parallel and distributed computation; algorithms for graphs, geometry, arithmetic, number theory, strings; on-line analysis; cryptography; coding; data compression; learning algorithms; methods of algorithmic analysis; discrete algorithms for application areas such as biology, economics, game theory, communication, computer systems and architecture, hardware design, scientific computing

期刊最新文献

Deterministic Replacement Path Covering On the complexity of symmetric vs. functional PCSPs Scattering and Sparse Partitions, and their Applications Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and \(k\) -mismatch Matching On Computing the \(k\) -Shortcut Fréchet Distance