文章基本信息

标题：Reachability for Branching Concurrent Stochastic Games
本地全文：下载
作者：Kousha Etessami ; Emanuel Martinov ; Alistair Stewart 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：132
页码：1-14
DOI：10.4230/LIPIcs.ICALP.2019.115
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We give polynomial time algorithms for deciding almost-sure and limit-sure reachability in Branching Concurrent Stochastic Games (BCSGs). These are a class of infinite-state imperfect-information stochastic games that generalize both finite-state concurrent stochastic reachability games ([L. de Alfaro et al., 2007]) and branching simple stochastic reachability games ([K. Etessami et al., 2018]).
关键词：stochastic games; multi-type branching processes; concurrent games; minimax-polynomial equations; reachability; almost-sure; limit-sure