Kristoffer Arnsfelt Hansen, M. Koucký, Peter Bro Miltersen
{"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}
引用次数: 33
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
