具有 Parysian 特色的优先权推广

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE

Journal of Computer and System Sciences Pub Date : 2024-08-28 DOI:10.1016/j.jcss.2024.103580

Massimo Benerecetti , Daniele Dell'Erba , Fabio Mogavero , Sven Schewe , Dominik Wojtczak

{"title":"具有 Parysian 特色的优先权推广","authors":"Massimo Benerecetti , Daniele Dell'Erba , Fabio Mogavero , Sven Schewe , Dominik Wojtczak","doi":"10.1016/j.jcss.2024.103580","DOIUrl":null,"url":null,"abstract":"<div><p>We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice, with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as they both generalise the classic recursive algorithm in different ways that appear to be irreconcilable: while the promotion transcends the call structure, the guarantees change on each level. We show that an interface that respects both is not only effective, but also efficient.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"147 ","pages":"Article 103580"},"PeriodicalIF":1.1000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000758/pdfft?md5=3e785823aeb6c21ee0b0856d965cf339&pid=1-s2.0-S0022000024000758-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Priority Promotion with Parysian flair\",\"authors\":\"Massimo Benerecetti , Daniele Dell'Erba , Fabio Mogavero , Sven Schewe , Dominik Wojtczak\",\"doi\":\"10.1016/j.jcss.2024.103580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice, with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as they both generalise the classic recursive algorithm in different ways that appear to be irreconcilable: while the promotion transcends the call structure, the guarantees change on each level. We show that an interface that respects both is not only effective, but also efficient.</p></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"147 \",\"pages\":\"Article 103580\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000758/pdfft?md5=3e785823aeb6c21ee0b0856d965cf339&pid=1-s2.0-S0022000024000758-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000758\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000024000758","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}

引用次数: 0

摘要

我们开发的算法结合了 "优先级提升 "和帕里斯算法提供的准多项式时间保证。"优先级提升 "是解决大型奇偶性博弈的主要方法之一，而帕里斯算法则提供了准多项式时间保证。混合使用这些算法听起来既自然又困难，因为它们都以不同的方式对经典递归算法进行了概括，而这些概括似乎是不可调和的：虽然优先级提升超越了调用结构，但每个层次上的保证都会发生变化。我们的研究表明，兼顾两者的接口不仅有效，而且高效。

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

查看原文本刊更多论文

Priority Promotion with Parysian flair

We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice, with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as they both generalise the classic recursive algorithm in different ways that appear to be irreconcilable: while the promotion transcends the call structure, the guarantees change on each level. We show that an interface that respects both is not only effective, but also efficient.

求助全文

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

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.