赢得并发可达性游戏需要双倍的耐心

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI:10.1109/LICS.2009.44

Kristoffer Arnsfelt Hansen, M. Koucký, Peter Bro Miltersen

{"title":"赢得并发可达性游戏需要双倍的耐心","authors":"Kristoffer Arnsfelt Hansen, M. Koucký, Peter Bro Miltersen","doi":"10.1109/LICS.2009.44","DOIUrl":null,"url":null,"abstract":"We exhibit a deterministic concurrent reachability game PURGATORY$_n$ with $n$ non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given $\\epsilon","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Winning Concurrent Reachability Games Requires Doubly-Exponential Patience\",\"authors\":\"Kristoffer Arnsfelt Hansen, M. Koucký, Peter Bro Miltersen\",\"doi\":\"10.1109/LICS.2009.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We exhibit a deterministic concurrent reachability game PURGATORY$_n$ with $n$ non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given $\\\\epsilon\",\"PeriodicalId\":415902,\"journal\":{\"name\":\"2009 24th Annual IEEE Symposium on Logic In Computer Science\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 24th Annual IEEE Symposium on Logic In Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2009.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 24th Annual IEEE Symposium on Logic In Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2009.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 33

摘要

我们展示了一个确定性并发可达性博弈PURGATORY$_n$，它具有$n$非终端位置，并且每个位置上的两个参与者都有一个二元选择，使得参与人1的任何位置策略都能在给定的$\epsilon内实现博弈的值

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

查看原文本刊更多论文

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience

We exhibit a deterministic concurrent reachability game PURGATORY$_n$ with $n$ non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given $\epsilon

求助全文

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

来源期刊

2009 24th Annual IEEE Symposium on Logic In Computer Science

自引率

0.00%

发文量