Pub Date : 2022-04-27DOI: 10.48550/arXiv.2204.12814
L. Doyen, Marie van den Bogaard
. We consider Markov decision processes with synchronizing objectives, which require that a probability mass of 1 − ε accumulates in a designated set of target states, either once, always, infinitely often, or always from some point on, where ε = 0 for sure synchronizing, and ε → 0 for almost-sure and limit-sure synchronizing. We introduce two new qualitative modes of synchronizing, where the probability mass should be either positive , or bounded away from 0. They can be viewed as dual synchronizing objectives. We present al-gorithms and tight complexity results for the problem of deciding if a Markov decision process is positive, or bounded synchronizing, and we provide explicit bounds on ε in all synchronizing modes. In particular, we show that deciding positive and bounded synchronizing always from some point on, is coNP-complete.
{"title":"Bounds for Synchronizing Markov Decision Processes","authors":"L. Doyen, Marie van den Bogaard","doi":"10.48550/arXiv.2204.12814","DOIUrl":"https://doi.org/10.48550/arXiv.2204.12814","url":null,"abstract":". We consider Markov decision processes with synchronizing objectives, which require that a probability mass of 1 − ε accumulates in a designated set of target states, either once, always, infinitely often, or always from some point on, where ε = 0 for sure synchronizing, and ε → 0 for almost-sure and limit-sure synchronizing. We introduce two new qualitative modes of synchronizing, where the probability mass should be either positive , or bounded away from 0. They can be viewed as dual synchronizing objectives. We present al-gorithms and tight complexity results for the problem of deciding if a Markov decision process is positive, or bounded synchronizing, and we provide explicit bounds on ε in all synchronizing modes. In particular, we show that deciding positive and bounded synchronizing always from some point on, is coNP-complete.","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128121097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-18DOI: 10.1007/978-3-031-09574-0_20
Thomas Place, M. Zeitoun
{"title":"Characterizing level one in group-based concatenation hierarchies","authors":"Thomas Place, M. Zeitoun","doi":"10.1007/978-3-031-09574-0_20","DOIUrl":"https://doi.org/10.1007/978-3-031-09574-0_20","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131068859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-24DOI: 10.1007/978-3-031-09574-0_14
A. Kozachinskiy
{"title":"New Bounds for the Flock-of-Birds Problem","authors":"A. Kozachinskiy","doi":"10.1007/978-3-031-09574-0_14","DOIUrl":"https://doi.org/10.1007/978-3-031-09574-0_14","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123448926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-28DOI: 10.1007/978-3-030-79416-3_5
P. Dutta
{"title":"Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization","authors":"P. Dutta","doi":"10.1007/978-3-030-79416-3_5","DOIUrl":"https://doi.org/10.1007/978-3-030-79416-3_5","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128168172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-03-06DOI: 10.1007/978-3-031-09574-0_16
Mizuhito Ogawa, A. Okhotin
{"title":"On the determinization of event-clock input-driven pushdown automata","authors":"Mizuhito Ogawa, A. Okhotin","doi":"10.1007/978-3-031-09574-0_16","DOIUrl":"https://doi.org/10.1007/978-3-031-09574-0_16","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114589268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-21DOI: 10.1007/978-3-030-79416-3_25
Nikolay V. Proskurin
{"title":"On Separation between the Degree of a Boolean Function and the Block Sensitivity","authors":"Nikolay V. Proskurin","doi":"10.1007/978-3-030-79416-3_25","DOIUrl":"https://doi.org/10.1007/978-3-030-79416-3_25","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114807590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：