[{"author":[{"first_name":"Juho","last_name":"Hirvonen","full_name":"Hirvonen, Juho"},{"last_name":"Schmid","first_name":"Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","full_name":"Schmid, Laura"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"license":"https://creativecommons.org/licenses/by/4.0/","day":"18","file":[{"checksum":"4fc7eea6e4ba140b904781fc7df868ec","date_updated":"2024-02-26T09:04:58Z","file_id":"15028","access_level":"open_access","date_created":"2024-02-26T09:04:58Z","success":1,"file_name":"2024_LIPICs_Hirvonen.pdf","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_size":867363}],"arxiv":1,"title":"On the convergence time in graphical games: A locality-sensitive approach","article_number":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication":"27th International Conference on Principles of Distributed Systems","ec_funded":1,"scopus_import":"1","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication_identifier":{"issn":["18688969"],"isbn":["9783959773089"]},"doi":"10.4230/LIPIcs.OPODIS.2023.11","quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"conference":{"start_date":"2023-12-06","name":"OPODIS: Conference on Principles of Distributed Systems","location":"Tokyo, Japan","end_date":"2023-12-08"},"language":[{"iso":"eng"}],"abstract":[{"text":"Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They have wide applications ranging from computer science to economics and biology. Yet, even though an agent’s payoff only depends on the actions of their direct neighbors in graphical games, computing the Nash equilibria and making statements about the convergence time of \"natural\" local dynamics in particular can be highly challenging. In this work, we present a novel approach for classifying complexity of Nash equilibria in graphical games by establishing a connection to local graph algorithms, a subfield of distributed computing. In particular, we make the observation that the equilibria of graphical games are equivalent to locally verifiable labelings (LVL) in graphs; vertex labelings which are verifiable with constant-round local algorithms. This connection allows us to derive novel lower bounds on the convergence time to equilibrium of best-response dynamics in graphical games. Since we establish that distributed convergence can sometimes be provably slow, we also introduce and give bounds on an intuitive notion of \"time-constrained\" inefficiency of best responses. We exemplify how our results can be used in the implementation of mechanisms that ensure convergence of best responses to a Nash equilibrium. Our results thus also give insight into the convergence of strategy-proof algorithms for graphical games, which is still not well understood.","lang":"eng"}],"date_updated":"2025-07-14T09:10:03Z","type":"conference","month":"01","oa_version":"Published Version","volume":286,"file_date_updated":"2024-02-26T09:04:58Z","date_created":"2024-02-18T23:01:01Z","acknowledgement":"This work was partially funded by the Academy of Finland, grant 314888, the European Research Council CoG 863818 (ForM-SMArt), and the Austrian Science Fund (FWF) project I 4800-N (ADVISE). LS was supported by the Stochastic Analysis and Application Research Center (SAARC) under National Research Foundation of Korea grant NRF-2019R1A5A1028324.","year":"2024","_id":"15006","publication_status":"published","oa":1,"has_accepted_license":"1","ddc":["000"],"date_published":"2024-01-18T00:00:00Z","alternative_title":["LIPIcs"],"external_id":{"arxiv":["2102.13457"]},"status":"public","intvolume":"       286","citation":{"chicago":"Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In <i>27th International Conference on Principles of Distributed Systems</i>, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">https://doi.org/10.4230/LIPIcs.OPODIS.2023.11</a>.","ieee":"J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in <i>27th International Conference on Principles of Distributed Systems</i>, Tokyo, Japan, 2024, vol. 286.","short":"J. Hirvonen, L. Schmid, K. Chatterjee, S. Schmid, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. On the convergence time in graphical games: A locality-sensitive approach. In: <i>27th International Conference on Principles of Distributed Systems</i>. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">10.4230/LIPIcs.OPODIS.2023.11</a>","apa":"Hirvonen, J., Schmid, L., Chatterjee, K., &#38; Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In <i>27th International Conference on Principles of Distributed Systems</i> (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">https://doi.org/10.4230/LIPIcs.OPODIS.2023.11</a>","ista":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. 2024. On the convergence time in graphical games: A locality-sensitive approach. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 11.","mla":"Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” <i>27th International Conference on Principles of Distributed Systems</i>, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">10.4230/LIPIcs.OPODIS.2023.11</a>."}},{"_id":"14317","acknowledgement":"This work was supported in part by the ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 as well as DST/CEFIPRA/INRIA project EQuaVE and SERB Matrices grant MTR/2018/00074.","year":"2023","volume":13966,"date_created":"2023-09-10T22:01:12Z","file_date_updated":"2023-09-20T08:46:43Z","page":"86-112","abstract":[{"lang":"eng","text":"Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.\r\nIn light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples."}],"date_updated":"2025-07-14T09:09:56Z","month":"07","type":"conference","oa_version":"Published Version","intvolume":"     13966","citation":{"chicago":"Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In <i>International Conference on Computer Aided Verification</i>, 13966:86–112. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">https://doi.org/10.1007/978-3-031-37709-9_5</a>.","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in <i>International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13966, pp. 86–112.","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 86–112.","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: <i>International Conference on Computer Aided Verification</i>. Vol 13966. Springer Nature; 2023:86-112. doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">10.1007/978-3-031-37709-9_5</a>","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., &#38; Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In <i>International Conference on Computer Aided Verification</i> (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">https://doi.org/10.1007/978-3-031-37709-9_5</a>","ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2023. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.","mla":"Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” <i>International Conference on Computer Aided Verification</i>, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">10.1007/978-3-031-37709-9_5</a>."},"alternative_title":["LNCS"],"status":"public","date_published":"2023-07-17T00:00:00Z","ddc":["000"],"oa":1,"publication_status":"published","has_accepted_license":"1","publication":"International Conference on Computer Aided Verification","ec_funded":1,"scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"title":"MDPs as distribution transformers: Affine invariant synthesis for safety objectives","author":[{"full_name":"Akshay, S.","first_name":"S.","last_name":"Akshay"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde"}],"day":"17","file":[{"checksum":"f143c8eedf609f20f2aad2eeb496d53f","date_updated":"2023-09-20T08:46:43Z","file_id":"14349","access_level":"open_access","date_created":"2023-09-20T08:46:43Z","success":1,"file_name":"2023_LNCS_Akshay.pdf","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_size":531745}],"conference":{"name":"CAV: Computer Aided Verification","location":"Paris, France","start_date":"2023-07-17","end_date":"2023-07-22"},"language":[{"iso":"eng"}],"project":[{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"doi":"10.1007/978-3-031-37709-9_5","quality_controlled":"1","publication_identifier":{"isbn":["9783031377082"],"eissn":["1611-3349"],"issn":["0302-9743"]}},{"intvolume":"     13966","related_material":{"link":[{"url":"https://github.com/boyvolcano/PRR","relation":"software"}]},"citation":{"short":"Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Computer Aided Verification, Springer Nature, 2023, pp. 16–39.","chicago":"Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In <i>Computer Aided Verification</i>, 13966:16–39. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">https://doi.org/10.1007/978-3-031-37709-9_2</a>.","ieee":"Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13966, pp. 16–39.","apa":"Sun, Y., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In <i>Computer Aided Verification</i> (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">https://doi.org/10.1007/978-3-031-37709-9_2</a>","mla":"Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” <i>Computer Aided Verification</i>, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">10.1007/978-3-031-37709-9_2</a>.","ista":"Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.","ama":"Sun Y, Fu H, Chatterjee K, Goharshady AK. Automated tail bound analysis for probabilistic recurrence relations. In: <i>Computer Aided Verification</i>. Vol 13966. Springer Nature; 2023:16-39. doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">10.1007/978-3-031-37709-9_2</a>"},"alternative_title":["LNCS"],"status":"public","ddc":["000"],"date_published":"2023-07-17T00:00:00Z","oa":1,"publication_status":"published","has_accepted_license":"1","_id":"14318","acknowledgement":"We thank Prof. Bican Xia for valuable information on the exponential theory of reals. The work is partially supported by the National Natural Science Foundation of China (NSFC) with Grant No. 62172271, ERC CoG 863818 (ForM-SMArt), the Hong Kong Research Grants Council ECS Project Number 26208122, the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055 and the HKUST Startup Grant R9272.","year":"2023","volume":13966,"date_created":"2023-09-10T22:01:12Z","file_date_updated":"2023-09-20T08:24:47Z","page":"16-39","abstract":[{"lang":"eng","text":"Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail probability Pr[T≥κ], i.e., the probability that the randomized runtime T of the PRR exceeds κ. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound u≥Pr[T≥κ]. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), while other approaches are mostly limited to deriving tail bounds of specific PRRs via involved custom analysis.\r\nIn this work, we propose a novel approach for deriving the common exponentially-decreasing tail bounds for PRRs whose preprocessing time and random passed sizes observe discrete or (piecewise) uniform distribution and whose recursive call is either a single procedure call or a divide-and-conquer. We first establish a theoretical approach via Markov’s inequality, and then instantiate the theoretical approach with a template-based algorithmic approach via a refined treatment of exponentiation. Experimental evaluation shows that our algorithmic approach is capable of deriving tail bounds that are (i) asymptotically tighter than Karp’s method, (ii) match the best-known manually-derived asymptotic tail bound for QuickSelect, and (iii) is only slightly worse (with a loglogn factor) than the manually-proven optimal asymptotic tail bound for QuickSort. Moreover, our algorithmic approach handles all examples (including realistic PRRs such as QuickSort, QuickSelect, DiameterComputation, etc.) in less than 0.1 s, showing that our approach is efficient in practice."}],"date_updated":"2025-07-14T09:09:57Z","type":"conference","oa_version":"Published Version","month":"07","conference":{"name":"CAV: Computer Aided Verification","location":"Paris, France","start_date":"2023-07-17","end_date":"2023-07-22"},"language":[{"iso":"eng"}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"doi":"10.1007/978-3-031-37709-9_2","quality_controlled":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031377082"],"issn":["0302-9743"]},"publication":"Computer Aided Verification","article_processing_charge":"Yes (in subscription journal)","ec_funded":1,"scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"title":"Automated tail bound analysis for probabilistic recurrence relations","author":[{"full_name":"Sun, Yican","last_name":"Sun","first_name":"Yican"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady"}],"file":[{"file_size":624647,"content_type":"application/pdf","relation":"main_file","creator":"dernst","file_name":"2023_LNCS_Sun.pdf","success":1,"date_created":"2023-09-20T08:24:47Z","access_level":"open_access","file_id":"14348","date_updated":"2023-09-20T08:24:47Z","checksum":"42917e086f8c7699f3bccf84f74fe000"}],"day":"17"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication":"48th International Symposium on Mathematical Foundations of Computer Science","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_processing_charge":"Yes","scopus_import":"1","ec_funded":1,"author":[{"last_name":"Baier","first_name":"Christel","full_name":"Baier, Christel"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer"},{"full_name":"Piribauer, Jakob","first_name":"Jakob","last_name":"Piribauer"}],"file":[{"file_name":"2023_LIPIcsMFCS_Baier.pdf","success":1,"file_size":826843,"content_type":"application/pdf","relation":"main_file","creator":"dernst","file_id":"14418","date_updated":"2023-10-09T09:19:11Z","checksum":"402281b17ed669bbf149d0fdf68ac201","date_created":"2023-10-09T09:19:11Z","access_level":"open_access"}],"day":"21","article_number":"15","arxiv":1,"title":"Entropic risk for turn-based stochastic games","project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"conference":{"end_date":"2023-09-01","name":"MFCS: Symposium on Mathematical Foundations of Computer Science","location":"Bordeaux, France","start_date":"2023-08-28"},"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772921"]},"doi":"10.4230/LIPIcs.MFCS.2023.15","quality_controlled":"1","acknowledgement":"This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the DFG Grant\r\n389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of\r\nExcellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy), and the DFG projects BA-1679/11-1 and BA-1679/12-1.","year":"2023","_id":"14417","oa_version":"Published Version","month":"08","type":"conference","abstract":[{"text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided.","lang":"eng"}],"date_updated":"2025-07-14T09:09:57Z","volume":272,"date_created":"2023-10-09T09:21:05Z","file_date_updated":"2023-10-09T09:19:11Z","alternative_title":["LIPIcs"],"status":"public","external_id":{"arxiv":["2307.06611"]},"intvolume":"       272","citation":{"ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: <i>48th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">10.4230/LIPIcs.MFCS.2023.15</a>","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">10.4230/LIPIcs.MFCS.2023.15</a>.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., &#38; Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In <i>48th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">https://doi.org/10.4230/LIPIcs.MFCS.2023.15</a>","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, Bordeaux, France, 2023, vol. 272.","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">https://doi.org/10.4230/LIPIcs.MFCS.2023.15</a>.","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 48th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"publication_status":"published","oa":1,"has_accepted_license":"1","date_published":"2023-08-21T00:00:00Z","ddc":["000"]},{"external_id":{"arxiv":["2307.15218"]},"status":"public","citation":{"chicago":"Avni, Guy, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, and Dorde Zikelic. “Reachability Poorman Discrete-Bidding Games.” In <i>Frontiers in Artificial Intelligence and Applications</i>, 372:141–48. IOS Press, 2023. <a href=\"https://doi.org/10.3233/FAIA230264\">https://doi.org/10.3233/FAIA230264</a>.","ieee":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in <i>Frontiers in Artificial Intelligence and Applications</i>, Krakow, Poland, 2023, vol. 372, pp. 141–148.","short":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.","ama":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman discrete-bidding games. In: <i>Frontiers in Artificial Intelligence and Applications</i>. Vol 372. IOS Press; 2023:141-148. doi:<a href=\"https://doi.org/10.3233/FAIA230264\">10.3233/FAIA230264</a>","apa":"Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &#38; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In <i>Frontiers in Artificial Intelligence and Applications</i> (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press. <a href=\"https://doi.org/10.3233/FAIA230264\">https://doi.org/10.3233/FAIA230264</a>","ista":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.","mla":"Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.” <i>Frontiers in Artificial Intelligence and Applications</i>, vol. 372, IOS Press, 2023, pp. 141–48, doi:<a href=\"https://doi.org/10.3233/FAIA230264\">10.3233/FAIA230264</a>."},"intvolume":"       372","has_accepted_license":"1","publication_status":"published","oa":1,"date_published":"2023-09-28T00:00:00Z","ddc":["000"],"year":"2023","acknowledgement":"This research was supported in part by ISF grant no. 1679/21, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie Grant Agreement No. 665385.","_id":"14518","date_updated":"2025-07-14T09:09:57Z","abstract":[{"lang":"eng","text":"We consider bidding games, a class of two-player zero-sum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in favor of Player 1. Player 1 wins the game iff the token visits a designated target vertex. We consider, for the first time, poorman discrete-bidding in which the granularity of the bids is restricted and the higher bid is paid to the bank. Previous work either did not impose granularity restrictions or considered Richman bidding (bids are paid to the opponent). While the latter mechanisms are technically more accessible, the former is more appealing from a practical standpoint. Our study focuses on threshold budgets, which is the necessary and sufficient initial budget required for Player 1 to ensure winning against a given Player 2 budget. We first show existence of thresholds. In DAGs, we show that threshold budgets can be approximated with error bounds by thresholds under continuous-bidding and that they exhibit a periodic behavior. We identify closed-form solutions in special cases. We implement and experiment with an algorithm to find threshold budgets."}],"month":"09","oa_version":"Published Version","type":"conference","page":"141-148","file_date_updated":"2023-11-13T10:16:10Z","date_created":"2023-11-12T23:00:56Z","volume":372,"project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"language":[{"iso":"eng"}],"conference":{"name":"ECAI: European Conference on Artificial Intelligence","location":"Krakow, Poland","start_date":"2023-09-30","end_date":"2023-10-04"},"publication_identifier":{"issn":["0922-6389"],"isbn":["9781643684369"]},"quality_controlled":"1","doi":"10.3233/FAIA230264","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IOS Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","scopus_import":"1","ec_funded":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"publication":"Frontiers in Artificial Intelligence and Applications","license":"https://creativecommons.org/licenses/by-nc/4.0/","file":[{"access_level":"open_access","date_created":"2023-11-13T10:16:10Z","checksum":"1390ca38480fa4cf286b0f1a42e8c12f","date_updated":"2023-11-13T10:16:10Z","file_id":"14529","creator":"dernst","relation":"main_file","content_type":"application/pdf","file_size":501011,"success":1,"file_name":"2023_FAIA_Avni.pdf"}],"day":"28","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy"},{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","first_name":"Tobias"},{"full_name":"Sadhukhan, Suman","first_name":"Suman","last_name":"Sadhukhan"},{"first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"}],"arxiv":1,"title":"Reachability poorman discrete-bidding games"},{"date_created":"2023-11-15T13:39:10Z","file_date_updated":"2023-11-15T13:44:24Z","page":"256","oa_version":"Published Version","month":"11","type":"dissertation","abstract":[{"text":"Stochastic systems provide a formal framework for modelling and quantifying uncertainty in systems and have been widely adopted in many application domains. Formal\r\nverification and control of finite state stochastic systems, a subfield of formal methods\r\nalso known as probabilistic model checking, is well studied. In contrast, formal verification and control of infinite state stochastic systems have received comparatively\r\nless attention. However, infinite state stochastic systems commonly arise in practice.\r\nFor instance, probabilistic models that contain continuous probability distributions such\r\nas normal or uniform, or stochastic dynamical systems which are a classical model for\r\ncontrol under uncertainty, both give rise to infinite state systems.\r\nThe goal of this thesis is to contribute to laying theoretical and algorithmic foundations\r\nof fully automated formal verification and control of infinite state stochastic systems,\r\nwith a particular focus on systems that may be executed over a long or infinite time.\r\nWe consider formal verification of infinite state stochastic systems in the setting of\r\nstatic analysis of probabilistic programs and formal control in the setting of controller\r\nsynthesis in stochastic dynamical systems. For both problems, we present some of the\r\nfirst fully automated methods for probabilistic (a.k.a. quantitative) reachability and\r\nsafety analysis applicable to infinite time horizon systems. We also advance the state\r\nof the art of probability 1 (a.k.a. qualitative) reachability analysis for both problems.\r\nFinally, for formal controller synthesis in stochastic dynamical systems, we present a\r\nnovel framework for learning neural network control policies in stochastic dynamical\r\nsystems with formal guarantees on correctness with respect to quantitative reachability,\r\nsafety or reach-avoid specifications.\r\n","lang":"eng"}],"date_updated":"2025-07-14T09:10:10Z","_id":"14539","year":"2023","date_published":"2023-11-15T00:00:00Z","ddc":["000"],"supervisor":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","oa":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1194"},{"id":"12000","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"12511"},{"status":"public","id":"14600","relation":"part_of_dissertation"},{"id":"14601","status":"public","relation":"part_of_dissertation"},{"id":"9644","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10414","status":"public"}]},"citation":{"mla":"Zikelic, Dorde. <i>Automated Verification and Control of Infinite State Stochastic Systems</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14539\">10.15479/14539</a>.","ista":"Zikelic D. 2023. Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria.","apa":"Zikelic, D. (2023). <i>Automated verification and control of infinite state stochastic systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14539\">https://doi.org/10.15479/14539</a>","ama":"Zikelic D. Automated verification and control of infinite state stochastic systems. 2023. doi:<a href=\"https://doi.org/10.15479/14539\">10.15479/14539</a>","short":"D. Zikelic, Automated Verification and Control of Infinite State Stochastic Systems, Institute of Science and Technology Austria, 2023.","ieee":"D. Zikelic, “Automated verification and control of infinite state stochastic systems,” Institute of Science and Technology Austria, 2023.","chicago":"Zikelic, Dorde. “Automated Verification and Control of Infinite State Stochastic Systems.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14539\">https://doi.org/10.15479/14539</a>."},"alternative_title":["ISTA Thesis"],"status":"public","title":"Automated verification and control of infinite state stochastic systems","degree_awarded":"PhD","author":[{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":2116426,"creator":"cchlebak","success":1,"file_name":"main.pdf","date_created":"2023-11-15T13:43:28Z","access_level":"open_access","date_updated":"2023-11-15T13:43:28Z","file_id":"14540","checksum":"f23e002b0059ca78e1fbb864da52dd7e"},{"file_name":"thesis_source.zip","file_size":35884057,"content_type":"application/x-zip-compressed","relation":"source_file","creator":"cchlebak","file_id":"14541","date_updated":"2023-11-15T13:44:24Z","checksum":"80ca37618a3c7b59866875f8be9b15ed","date_created":"2023-11-15T13:44:24Z","access_level":"closed"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","day":"15","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)"},"ec_funded":1,"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Institute of Science and Technology Austria","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"doi":"10.15479/14539","publication_identifier":{"issn":["2663 - 337X"],"isbn":["978-3-99078-036-7"]},"language":[{"iso":"eng"}],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}]},{"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2023","_id":"14559","page":"357-379","abstract":[{"text":"We consider the problem of learning control policies in discrete-time stochastic systems which guarantee that the system stabilizes within some specified stabilization region with probability 1. Our approach is based on the novel notion of stabilizing ranking supermartingales (sRSMs) that we introduce in this work. Our sRSMs overcome the limitation of methods proposed in previous works whose applicability is restricted to systems in which the stabilizing region cannot be left once entered under any control policy. We present a learning procedure that learns a control policy together with an sRSM that formally certifies probability 1 stability, both learned as neural networks. We show that this procedure can also be adapted to formally verifying that, under a given Lipschitz continuous control policy, the stochastic system stabilizes within some stabilizing region with probability 1. Our experimental evaluation shows that our learning procedure can successfully learn provably stabilizing policies in practice.","lang":"eng"}],"date_updated":"2025-07-14T09:09:59Z","month":"10","oa_version":"None","type":"conference","volume":14215,"date_created":"2023-11-19T23:00:56Z","alternative_title":["LNCS"],"status":"public","intvolume":"     14215","citation":{"chicago":"Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, 14215:357–79. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>.","ieee":"M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.","short":"M. Ansaripour, K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, 21st International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2023, pp. 357–379.","ama":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. Learning provably stabilizing neural controllers for discrete-time stochastic systems. In: <i>21st International Symposium on Automated Technology for Verification and Analysis</i>. Vol 14215. Springer Nature; 2023:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>","apa":"Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In <i>21st International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>","ista":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379.","mla":"Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>."},"publication_status":"published","date_published":"2023-10-22T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication":"21st International Symposium on Automated Technology for Verification and Analysis","scopus_import":"1","article_processing_charge":"No","ec_funded":1,"author":[{"full_name":"Ansaripour, Matin","last_name":"Ansaripour","first_name":"Matin"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"day":"22","title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"conference":{"end_date":"2023-10-27","location":"Singapore, Singapore","name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2023-10-24"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783031453281"],"eissn":["1611-3349"],"issn":["0302-9743"]},"doi":"10.1007/978-3-031-45329-8_17","quality_controlled":"1"},{"acknowledgement":"K.C. acknowledges support from the ERC CoG 863818(ForM-SMArt). J.T. is supported by Center for Foundations ofModern Computer Science (Charles Univ. project UNCE/SCI/004).","year":"2023","_id":"14657","month":"11","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Natural selection is usually studied between mutants that differ in reproductive rate, but are subject to the same population structure. Here we explore how natural selection acts on mutants that have the same reproductive rate, but different population structures. In our framework, population structure is given by a graph that specifies where offspring can disperse. The invading mutant disperses offspring on a different graph than the resident wild-type. We find that more densely connected dispersal graphs tend to increase the invader’s fixation probability, but the exact relationship between structure and fixation probability is subtle. We present three main results. First, we prove that if both invader and resident are on complete dispersal graphs, then removing a single edge in the invader’s dispersal graph reduces its fixation probability. Second, we show that for certain island models higher invader’s connectivity increases its fixation probability, but the magnitude of the effect depends on the exact layout of the connections. Third, we show that for lattices the effect of different connectivity is comparable to that of different fitness: for large population size, the invader’s fixation probability is either constant or exponentially small, depending on whether it is more or less connected than the resident.","lang":"eng"}],"date_updated":"2025-07-14T09:10:00Z","volume":20,"file_date_updated":"2023-12-11T11:10:32Z","date_created":"2023-12-10T23:00:58Z","external_id":{"pmid":["38016637"]},"status":"public","intvolume":"        20","citation":{"short":"J. Tkadlec, K. Kaveh, K. Chatterjee, M.A. Nowak, Journal of the Royal Society, Interface 20 (2023).","ieee":"J. Tkadlec, K. Kaveh, K. Chatterjee, and M. A. Nowak, “Evolutionary dynamics of mutants that modify population structure,” <i>Journal of the Royal Society, Interface</i>, vol. 20, no. 208. The Royal Society, 2023.","chicago":"Tkadlec, Josef, Kamran Kaveh, Krishnendu Chatterjee, and Martin A. Nowak. “Evolutionary Dynamics of Mutants That Modify Population Structure.” <i>Journal of the Royal Society, Interface</i>. The Royal Society, 2023. <a href=\"https://doi.org/10.1098/rsif.2023.0355\">https://doi.org/10.1098/rsif.2023.0355</a>.","mla":"Tkadlec, Josef, et al. “Evolutionary Dynamics of Mutants That Modify Population Structure.” <i>Journal of the Royal Society, Interface</i>, vol. 20, no. 208, 20230355, The Royal Society, 2023, doi:<a href=\"https://doi.org/10.1098/rsif.2023.0355\">10.1098/rsif.2023.0355</a>.","ista":"Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. 2023. Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. 20(208), 20230355.","apa":"Tkadlec, J., Kaveh, K., Chatterjee, K., &#38; Nowak, M. A. (2023). Evolutionary dynamics of mutants that modify population structure. <i>Journal of the Royal Society, Interface</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsif.2023.0355\">https://doi.org/10.1098/rsif.2023.0355</a>","ama":"Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. Evolutionary dynamics of mutants that modify population structure. <i>Journal of the Royal Society, Interface</i>. 2023;20(208). doi:<a href=\"https://doi.org/10.1098/rsif.2023.0355\">10.1098/rsif.2023.0355</a>"},"publication_status":"published","oa":1,"has_accepted_license":"1","ddc":["000","570"],"date_published":"2023-11-29T00:00:00Z","publisher":"The Royal Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"pmid":1,"publication":"Journal of the Royal Society, Interface","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","author":[{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec"},{"last_name":"Kaveh","first_name":"Kamran","full_name":"Kaveh, Kamran"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Martin A.","last_name":"Nowak","full_name":"Nowak, Martin A."}],"day":"29","file":[{"access_level":"open_access","date_created":"2023-12-11T11:10:32Z","checksum":"2eefab13127c7786dbd33303c482a004","file_id":"14673","date_updated":"2023-12-11T11:10:32Z","creator":"dernst","file_size":1720243,"content_type":"application/pdf","relation":"main_file","file_name":"2023_RoyalInterface_Tkadlec.pdf","success":1}],"article_number":"20230355","title":"Evolutionary dynamics of mutants that modify population structure","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"issue":"208","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1742-5662"]},"doi":"10.1098/rsif.2023.0355","quality_controlled":"1"},{"status":"public","alternative_title":["LNCS"],"citation":{"short":"M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.","ieee":"M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in <i>27th International Conference on Financial Cryptography and Data Security</i>, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325.","chicago":"Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In <i>27th International Conference on Financial Cryptography and Data Security</i>, 13950:309–25. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>.","ista":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.","mla":"Bastankhah, Mahsa, et al. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” <i>27th International Conference on Financial Cryptography and Data Security</i>, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>.","apa":"Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In <i>27th International Conference on Financial Cryptography and Data Security</i> (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>","ama":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. R2: Boosting liquidity in payment channel networks with online admission control. In: <i>27th International Conference on Financial Cryptography and Data Security</i>. Vol 13950. Springer Nature; 2023:309-325. doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>"},"intvolume":"     13950","publication_status":"published","date_published":"2023-12-01T00:00:00Z","year":"2023","acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","_id":"14736","month":"12","type":"conference","oa_version":"None","abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks."}],"date_updated":"2025-07-14T09:10:01Z","page":"309-325","date_created":"2024-01-08T09:30:22Z","volume":13950,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2023-05-05","location":"Bol, Brac, Croatia","name":"FC: Financial Cryptography and Data Security","start_date":"2023-05-01"},"publication_identifier":{"isbn":["9783031477539"],"eissn":["1611-3349"],"eisbn":["9783031477546"],"issn":["0302-9743"]},"quality_controlled":"1","doi":"10.1007/978-3-031-47754-6_18","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","ec_funded":1,"article_processing_charge":"No","publication":"27th International Conference on Financial Cryptography and Data Security","day":"01","author":[{"full_name":"Bastankhah, Mahsa","last_name":"Bastankhah","first_name":"Mahsa"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maddah-Ali","first_name":"Mohammad Ali","full_name":"Maddah-Ali, Mohammad Ali"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda"},{"last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809","full_name":"Yeo, Michelle X"}],"title":"R2: Boosting liquidity in payment channel networks with online admission control"},{"quality_controlled":"1","doi":"10.1145/3585391","publication_identifier":{"issn":["0934-5043"],"eissn":["1433-299X"]},"issue":"2","language":[{"iso":"eng"}],"keyword":["Theoretical Computer Science","Software"],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"article_number":"11","title":"On lexicographic proof rules for probabilistic termination","arxiv":1,"day":"23","file":[{"file_name":"2023_FormalAspectsComputing_Chatterjee.pdf","success":1,"creator":"dernst","file_size":502522,"relation":"main_file","content_type":"application/pdf","checksum":"3bb133eeb27ec01649a9a36445d952d9","file_id":"14804","date_updated":"2024-01-16T08:11:24Z","access_level":"open_access","date_created":"2024-01-16T08:11:24Z"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Kafshdar Goharshady","first_name":"Ehsan","full_name":"Kafshdar Goharshady, Ehsan"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný"},{"last_name":"Zárevúcky","first_name":"Jiří","full_name":"Zárevúcky, Jiří"},{"last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"}],"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_processing_charge":"Yes (via OA deal)","ec_funded":1,"publication":"Formal Aspects of Computing","department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-06-23T00:00:00Z","ddc":["000"],"has_accepted_license":"1","oa":1,"publication_status":"published","citation":{"ama":"Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. <i>Formal Aspects of Computing</i>. 2023;35(2). doi:<a href=\"https://doi.org/10.1145/3585391\">10.1145/3585391</a>","apa":"Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., &#38; Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. <i>Formal Aspects of Computing</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3585391\">https://doi.org/10.1145/3585391</a>","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” <i>Formal Aspects of Computing</i>, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3585391\">10.1145/3585391</a>.","ista":"Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2023. On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. 35(2), 11.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” <i>Formal Aspects of Computing</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3585391\">https://doi.org/10.1145/3585391</a>.","ieee":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” <i>Formal Aspects of Computing</i>, vol. 35, no. 2. Association for Computing Machinery, 2023.","short":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, Formal Aspects of Computing 35 (2023)."},"intvolume":"        35","related_material":{"record":[{"relation":"earlier_version","id":"10414","status":"public"}]},"status":"public","external_id":{"arxiv":["2108.02188"]},"date_created":"2024-01-10T09:27:43Z","file_date_updated":"2024-01-16T08:11:24Z","volume":35,"type":"journal_article","oa_version":"Published Version","month":"06","date_updated":"2025-07-14T09:10:10Z","abstract":[{"text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.","lang":"eng"}],"_id":"14778","year":"2023","acknowledgement":"This research was partially supported by the ERC CoG (grant no. 863818; ForM-SMArt), the Czech Science Foundation (grant no. GA21-24711S), and the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385."},{"citation":{"apa":"Zikelic, D., Lechner, M., Henzinger, T. A., &#38; Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">https://doi.org/10.1609/aaai.v37i10.26407</a>","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. 2023. Learning control policies for stochastic systems with reach-avoid guarantees. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 11926–11935.","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 10, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–35, doi:<a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">10.1609/aaai.v37i10.26407</a>.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:11926-11935. doi:<a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">10.1609/aaai.v37i10.26407</a>","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–11935.","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">https://doi.org/10.1609/aaai.v37i10.26407</a>.","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935."},"intvolume":"        37","related_material":{"record":[{"status":"public","id":"14600","relation":"earlier_version"}]},"status":"public","external_id":{"arxiv":["2210.05308"]},"date_published":"2023-06-26T00:00:00Z","publication_status":"published","_id":"14830","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","date_created":"2024-01-18T07:44:31Z","volume":37,"abstract":[{"lang":"eng","text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold p in [0,1] over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on 3 stochastic non-linear reinforcement learning tasks."}],"date_updated":"2025-07-14T09:10:02Z","month":"06","oa_version":"Preprint","type":"conference","page":"11926-11935","language":[{"iso":"eng"}],"issue":"10","keyword":["General Medicine"],"conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"Washington, DC, United States","start_date":"2023-02-07","end_date":"2023-02-14"},"project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"quality_controlled":"1","doi":"10.1609/aaai.v37i10.26407","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"]},"article_processing_charge":"No","ec_funded":1,"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for the Advancement of Artificial Intelligence","title":"Learning control policies for stochastic systems with reach-avoid guarantees","arxiv":1,"day":"26","author":[{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}]},{"publication_status":"epub_ahead","oa":1,"date_published":"2023-12-15T00:00:00Z","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.01456","open_access":"1"}],"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"external_id":{"arxiv":["2312.01456"]},"status":"public","conference":{"location":"New Orleans, LO, United States","name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10","end_date":"2023-12-16"},"citation":{"mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LO, United States.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: <i>37th Conference on Neural Information Processing Systems</i>. ; 2023.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LO, United States, 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In <i>37th Conference on Neural Information Processing Systems</i>, 2023."},"language":[{"iso":"eng"}],"author":[{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde"},{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6","full_name":"Verma, Abhinav","last_name":"Verma","first_name":"Abhinav"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"month":"12","type":"conference","oa_version":"Preprint","day":"15","abstract":[{"lang":"eng","text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment."}],"date_updated":"2025-07-14T09:10:04Z","arxiv":1,"title":"Compositional policy learning in stochastic control systems with formal guarantees","date_created":"2024-02-25T09:23:24Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"15023","publication":"37th Conference on Neural Information Processing Systems","ec_funded":1,"article_processing_charge":"No"},{"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"}],"day":"22","file":[{"date_updated":"2023-06-19T08:29:30Z","file_id":"13150","checksum":"3d8a8bb24d211bc83360dfc2fd744307","date_created":"2023-06-19T08:29:30Z","access_level":"open_access","success":1,"file_name":"2023_LNCS_Chatterjee.pdf","content_type":"application/pdf","relation":"main_file","file_size":528455,"creator":"dernst"}],"title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication":"Tools and Algorithms for the Construction and Analysis of Systems ","article_processing_charge":"No","ec_funded":1,"scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031308222"]},"doi":"10.1007/978-3-031-30823-9_1","quality_controlled":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Paris, France","start_date":"2023-04-22","end_date":"2023-04-27"},"language":[{"iso":"eng"}],"page":"3-25","date_updated":"2025-07-14T09:09:52Z","abstract":[{"lang":"eng","text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions."}],"type":"conference","oa_version":"Published Version","month":"04","volume":13993,"file_date_updated":"2023-06-19T08:29:30Z","date_created":"2023-06-18T22:00:47Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2023","_id":"13142","oa":1,"publication_status":"published","has_accepted_license":"1","date_published":"2023-04-22T00:00:00Z","ddc":["000"],"alternative_title":["LNCS"],"status":"public","intvolume":"     13993","citation":{"ama":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: <i>Tools and Algorithms for the Construction and Analysis of Systems </i>. Vol 13993. Springer Nature; 2023:3-25. doi:<a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">10.1007/978-3-031-30823-9_1</a>","ista":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.","mla":"Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” <i>Tools and Algorithms for the Construction and Analysis of Systems </i>, vol. 13993, Springer Nature, 2023, pp. 3–25, doi:<a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">10.1007/978-3-031-30823-9_1</a>.","apa":"Chatterjee, K., Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In <i>Tools and Algorithms for the Construction and Analysis of Systems </i> (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">https://doi.org/10.1007/978-3-031-30823-9_1</a>","ieee":"K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in <i>Tools and Algorithms for the Construction and Analysis of Systems </i>, Paris, France, 2023, vol. 13993, pp. 3–25.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In <i>Tools and Algorithms for the Construction and Analysis of Systems </i>, 13993:3–25. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">https://doi.org/10.1007/978-3-031-30823-9_1</a>.","short":"K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25."}},{"department":[{"_id":"KrPi"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","article_processing_charge":"No","ec_funded":1,"scopus_import":"1","publication":"SIROCCO 2023: Structural Information and Communication Complexity ","day":"25","author":[{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Svoboda","first_name":"Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"},{"full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle X","last_name":"Yeo"}],"arxiv":1,"title":"Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2023-06-09","start_date":"2023-06-06","name":"SIROCCO: Structural Information and Communication Complexity","location":"Alcala de Henares, Spain"},"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031327322"]},"quality_controlled":"1","doi":"10.1007/978-3-031-32733-9_26","year":"2023","acknowledgement":"We thank Mahsa Bastankhah and Mohammad Ali Maddah-Ali for fruitful discussions about different variants of the problem. This work is supported by the European Research Council (ERC) Consolidator Project 864228 (AdjustNet), 2020-2025, the ERC CoG 863818 (ForM-SMArt), and the German Research Foundation (DFG) grant 470029389 (FlexNets), 2021–2024.","_id":"13238","oa_version":"Preprint","month":"05","type":"conference","date_updated":"2025-07-14T09:09:53Z","abstract":[{"lang":"eng","text":"We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1+ε)⋅(1+3–√) for some arbitrary ε>0.\r\n."}],"page":"576-594","date_created":"2023-07-16T22:01:12Z","volume":13892,"external_id":{"arxiv":["2204.13459"]},"status":"public","alternative_title":["LNCS"],"citation":{"short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, SIROCCO 2023: Structural Information and Communication Complexity , Springer Nature, 2023, pp. 576–594.","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in <i>SIROCCO 2023: Structural Information and Communication Complexity </i>, Alcala de Henares, Spain, 2023, vol. 13892, pp. 576–594.","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In <i>SIROCCO 2023: Structural Information and Communication Complexity </i>, 13892:576–94. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>.","mla":"Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” <i>SIROCCO 2023: Structural Information and Communication Complexity </i>, vol. 13892, Springer Nature, 2023, pp. 576–94, doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>.","ista":"Schmid S, Svoboda J, Yeo MX. 2023. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. SIROCCO 2023: Structural Information and Communication Complexity . SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 13892, 576–594.","apa":"Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In <i>SIROCCO 2023: Structural Information and Communication Complexity </i> (Vol. 13892, pp. 576–594). Alcala de Henares, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>","ama":"Schmid S, Svoboda J, Yeo MX. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: <i>SIROCCO 2023: Structural Information and Communication Complexity </i>. Vol 13892. Springer Nature; 2023:576-594. doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>"},"intvolume":"     13892","related_material":{"record":[{"id":"14506","status":"public","relation":"dissertation_contains"}]},"oa":1,"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2204.13459","open_access":"1"}],"date_published":"2023-05-25T00:00:00Z"},{"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"isi":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2041-1723"]},"doi":"10.1038/s41467-023-39625-9","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","pmid":1,"department":[{"_id":"KrCh"}],"publication":"Nature Communications","scopus_import":"1","article_processing_charge":"Yes","ec_funded":1,"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"author":[{"last_name":"Kleshnina","first_name":"Maria","full_name":"Kleshnina, Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"id":"409d615c-2f95-11ee-b934-90a352102c1e","orcid":"0000-0001-6687-1210","full_name":"Simsa, Stepan","first_name":"Stepan","last_name":"Simsa"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Martin A.","last_name":"Nowak","full_name":"Nowak, Martin A."}],"file":[{"checksum":"5aceefdfe76686267b93ae4fe81899f1","file_id":"13337","date_updated":"2023-07-31T11:32:36Z","access_level":"open_access","date_created":"2023-07-31T11:32:36Z","file_name":"2023_NatureComm_Kleshnina.pdf","success":1,"creator":"dernst","file_size":1601682,"relation":"main_file","content_type":"application/pdf"}],"day":"12","title":"The effect of environmental information on evolution of cooperation in stochastic games","article_number":"4153","status":"public","external_id":{"isi":["001029450400031"],"pmid":["37438341"]},"related_material":{"record":[{"relation":"research_data","id":"13336","status":"public"}]},"intvolume":"        14","citation":{"chicago":"Kleshnina, Maria, Christian Hilbe, Stepan Simsa, Krishnendu Chatterjee, and Martin A. Nowak. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” <i>Nature Communications</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41467-023-39625-9\">https://doi.org/10.1038/s41467-023-39625-9</a>.","ieee":"M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, and M. A. Nowak, “The effect of environmental information on evolution of cooperation in stochastic games,” <i>Nature Communications</i>, vol. 14. Springer Nature, 2023.","short":"M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, M.A. Nowak, Nature Communications 14 (2023).","ama":"Kleshnina M, Hilbe C, Simsa S, Chatterjee K, Nowak MA. The effect of environmental information on evolution of cooperation in stochastic games. <i>Nature Communications</i>. 2023;14. doi:<a href=\"https://doi.org/10.1038/s41467-023-39625-9\">10.1038/s41467-023-39625-9</a>","apa":"Kleshnina, M., Hilbe, C., Simsa, S., Chatterjee, K., &#38; Nowak, M. A. (2023). The effect of environmental information on evolution of cooperation in stochastic games. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-023-39625-9\">https://doi.org/10.1038/s41467-023-39625-9</a>","ista":"Kleshnina M, Hilbe C, Simsa S, Chatterjee K, Nowak MA. 2023. The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. 14, 4153.","mla":"Kleshnina, Maria, et al. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” <i>Nature Communications</i>, vol. 14, 4153, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1038/s41467-023-39625-9\">10.1038/s41467-023-39625-9</a>."},"oa":1,"publication_status":"published","has_accepted_license":"1","ddc":["000"],"date_published":"2023-07-12T00:00:00Z","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir programme, ANR-17-EURE-0010) (to M.K.).","year":"2023","_id":"13258","date_updated":"2025-07-14T09:09:53Z","abstract":[{"text":"Many human interactions feature the characteristics of social dilemmas where individual actions have consequences for the group and the environment. The feedback between behavior and environment can be studied with the framework of stochastic games. In stochastic games, the state of the environment can change, depending on the choices made by group members. Past work suggests that such feedback can reinforce cooperative behaviors. In particular, cooperation can evolve in stochastic games even if it is infeasible in each separate repeated game. In stochastic games, participants have an interest in conditioning their strategies on the state of the environment. Yet in many applications, precise information about the state could be scarce. Here, we study how the availability of information (or lack thereof) shapes evolution of cooperation. Already for simple examples of two state games we find surprising effects. In some cases, cooperation is only possible if there is precise information about the state of the environment. In other cases, cooperation is most abundant when there is no information about the state of the environment. We systematically analyze all stochastic games of a given complexity class, to determine when receiving information about the environment is better, neutral, or worse for evolution of cooperation.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","month":"07","volume":14,"date_created":"2023-07-23T22:01:11Z","file_date_updated":"2023-07-31T11:32:36Z"},{"date_created":"2023-08-27T22:01:17Z","volume":37,"date_updated":"2025-07-14T09:09:56Z","abstract":[{"lang":"eng","text":"We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs."}],"oa_version":"Preprint","type":"conference","month":"06","page":"14964-14973","_id":"14242","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. Research was sponsored by the United\r\nStates Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-\r\n1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied,\r\nof the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright\r\nnotation herein. The research was also funded in part by the AI2050 program at Schmidt Futures (Grant G-22-63172) and Capgemini SE.","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.16187","open_access":"1"}],"date_published":"2023-06-26T00:00:00Z","publication_status":"published","oa":1,"citation":{"ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:14964-14973. doi:<a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">10.1609/aaai.v37i12.26747</a>","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.","mla":"Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:<a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">10.1609/aaai.v37i12.26747</a>.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., &#38; Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">https://doi.org/10.1609/aaai.v37i12.26747</a>","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">https://doi.org/10.1609/aaai.v37i12.26747</a>.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, D. Rus, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–14973."},"intvolume":"        37","external_id":{"arxiv":["2211.16187"]},"status":"public","title":"Quantization-aware interval bound propagation for training certifiably robust quantized neural networks","arxiv":1,"day":"26","author":[{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"first_name":"Dorde","last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"article_processing_charge":"No","scopus_import":"1","ec_funded":1,"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for the Advancement of Artificial Intelligence","quality_controlled":"1","doi":"10.1609/aaai.v37i12.26747","publication_identifier":{"isbn":["9781577358800"]},"language":[{"iso":"eng"}],"issue":"12","conference":{"location":"Washington, DC, United States","name":"AAAI: Conference on Artificial Intelligence","start_date":"2023-02-07","end_date":"2023-02-14"},"project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"date_created":"2023-08-27T22:01:18Z","volume":37,"month":"06","type":"conference","oa_version":"Published Version","abstract":[{"text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games.","lang":"eng"}],"date_updated":"2025-07-14T09:09:56Z","page":"5464-5471","_id":"14243","year":"2023","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}],"date_published":"2023-06-27T00:00:00Z","publication_status":"published","oa":1,"citation":{"ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:5464–71, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. ; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 5, 2023, pp. 5464–71, doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>.","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 5464–5471). Washington, DC, United States. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>"},"intvolume":"        37","external_id":{"arxiv":["2211.13626"]},"status":"public","title":"Bidding graph games with partially-observable budgets","arxiv":1,"day":"27","author":[{"first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde"}],"scopus_import":"1","ec_funded":1,"article_processing_charge":"No","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.1609/aaai.v37i5.25679","publication_identifier":{"isbn":["9781577358800"]},"issue":"5","language":[{"iso":"eng"}],"conference":{"end_date":"2023-02-14","start_date":"2023-02-07","location":"Washington, DC, United States","name":"AAAI: Conference on Artificial Intelligence"},"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}]},{"status":"public","citation":{"ama":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm for turn-based stochastic games with bounded treewidth. In: <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2023:4590-4605. doi:<a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">10.1137/1.9781611977554.ch173</a>","apa":"Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., &#38; Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">https://doi.org/10.1137/1.9781611977554.ch173</a>","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:<a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">10.1137/1.9781611977554.ch173</a>.","ista":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605.","chicago":"Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” In <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 4590–4605. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">https://doi.org/10.1137/1.9781611977554.ch173</a>.","ieee":"K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Florence, Italy, 2023, pp. 4590–4605.","short":"K. Chatterjee, T. Meggendorfer, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–4605."},"publication_status":"published","oa":1,"date_published":"2023-02-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1137/1.9781611977554.ch173","open_access":"1"}],"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","year":"2023","_id":"12676","page":"4590-4605","type":"conference","month":"02","oa_version":"Published Version","date_updated":"2025-07-14T09:09:50Z","abstract":[{"lang":"eng","text":"Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum games played on directed graphs with probabilistic transitions. The goal of player-max is to maximize the probability to reach a target state against the adversarial player-min. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class for which the existence of polynomial-time algorithm is a major open question. While randomized sub-exponential time algorithm exists, all known deterministic algorithms require exponential time in the worst-case. An important open question has been whether faster algorithms can be obtained parametrized by the treewidth of the game graph. Even deterministic sub-exponential time algorithm for constant treewidth turn-based stochastic games has remain elusive. In this work our main result is a deterministic algorithm to solve turn-based stochastic games that, given a game with n states, treewidth at most t, and the bit-complexity of the probabilistic transition function log D, has running time O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time for games with constant or poly-logarithmic treewidth."}],"date_created":"2023-02-24T12:20:47Z","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"conference":{"end_date":"2023-01-25","start_date":"2023-01-22","name":"SODA: Symposium on Discrete Algorithms","location":"Florence, Italy"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781611977554"]},"doi":"10.1137/1.9781611977554.ch173","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms","article_processing_charge":"No","ec_funded":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Meggendorfer","first_name":"Tobias","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J","last_name":"Saona Urmeneta"},{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub"}],"day":"01","title":"Faster algorithm for turn-based stochastic games with bounded treewidth"},{"date_created":"2023-03-19T23:00:59Z","abstract":[{"lang":"eng","text":"We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP, matching the current known bound for single objectives; and in general the decision problem is PSPACE-hard and can be solved in NEXPTIME∩coNEXPTIME. We present an algorithm that computes the lexicographically optimal strategies via a reduction to the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies."}],"date_updated":"2025-07-14T09:10:14Z","month":"03","type":"journal_article","oa_version":"Published Version","_id":"12738","year":"2023","acknowledgement":"Tobias Winkler and Joost-Pieter Katoen are supported by the DFG RTG 2236 UnRAVeL and the innovation programme under the Marie Skłodowska-Curie grant agreement No. 101008233 (Mission). Krishnendu Chatterjee is supported by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) Project ICT15-003. Maximilian Weininger is supported by the DFG projects 383882557 Statistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic Verification (GOPro). Stefanie Mohr is supported by the DFG RTG 2428 CONVEY. Open Access funding enabled and organized by Projekt DEAL.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s10703-023-00411-4"}],"date_published":"2023-03-08T00:00:00Z","ddc":["000"],"oa":1,"publication_status":"epub_ahead","citation":{"ama":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. Stochastic games with lexicographic objectives. <i>Formal Methods in System Design</i>. 2023. doi:<a href=\"https://doi.org/10.1007/s10703-023-00411-4\">10.1007/s10703-023-00411-4</a>","apa":"Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., &#38; Winkler, T. (2023). Stochastic games with lexicographic objectives. <i>Formal Methods in System Design</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10703-023-00411-4\">https://doi.org/10.1007/s10703-023-00411-4</a>","ista":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.” <i>Formal Methods in System Design</i>, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1007/s10703-023-00411-4\">10.1007/s10703-023-00411-4</a>.","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” <i>Formal Methods in System Design</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s10703-023-00411-4\">https://doi.org/10.1007/s10703-023-00411-4</a>.","ieee":"K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” <i>Formal Methods in System Design</i>. Springer Nature, 2023.","short":"K. Chatterjee, J.P. Katoen, S. Mohr, M. Weininger, T. Winkler, Formal Methods in System Design (2023)."},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"8272"}]},"status":"public","external_id":{"isi":["000946174300001"]},"title":"Stochastic games with lexicographic objectives","day":"08","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Katoen","first_name":"Joost P","full_name":"Katoen, Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mohr, Stefanie","first_name":"Stefanie","last_name":"Mohr"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"},{"last_name":"Winkler","first_name":"Tobias","full_name":"Winkler, Tobias"}],"ec_funded":1,"article_processing_charge":"No","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","publication":"Formal Methods in System Design","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","quality_controlled":"1","doi":"10.1007/s10703-023-00411-4","publication_identifier":{"eissn":["1572-8102"]},"language":[{"iso":"eng"}],"isi":1,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}]},{"author":[{"last_name":"Svoboda","first_name":"Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"},{"first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"full_name":"Kaveh, Kamran","first_name":"Kamran","last_name":"Kaveh"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"}],"day":"29","file":[{"success":1,"file_name":"2023_ProceedingsRoyalSocietyA_Svoboda.pdf","content_type":"application/pdf","relation":"main_file","file_size":827784,"creator":"dernst","date_updated":"2023-04-03T06:25:29Z","file_id":"12796","checksum":"13953d349fbefcb5d21ccc6b303297eb","date_created":"2023-04-03T06:25:29Z","access_level":"open_access"}],"article_number":"20220685","title":"Coexistence times in the Moran process with environmental heterogeneity","publisher":"The Royal Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"KrCh"}],"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"scopus_import":"1","ec_funded":1,"article_processing_charge":"No","publication_identifier":{"eissn":["1471-2946"],"issn":["1364-5021"]},"doi":"10.1098/rspa.2022.0685","quality_controlled":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"isi":1,"issue":"2271","language":[{"iso":"eng"}],"type":"journal_article","month":"03","oa_version":"Published Version","date_updated":"2025-07-14T09:09:51Z","abstract":[{"text":"Populations evolve in spatially heterogeneous environments. While a certain trait might bring a fitness advantage in some patch of the environment, a different trait might be advantageous in another patch. Here, we study the Moran birth–death process with two types of individuals in a population stretched across two patches of size N, each patch favouring one of the two types. We show that the long-term fate of such populations crucially depends on the migration rate μ\r\n between the patches. To classify the possible fates, we use the distinction between polynomial (short) and exponential (long) timescales. We show that when μ is high then one of the two types fixates on the whole population after a number of steps that is only polynomial in N. By contrast, when μ is low then each type holds majority in the patch where it is favoured for a number of steps that is at least exponential in N. Moreover, we precisely identify the threshold migration rate μ⋆ that separates those two scenarios, thereby exactly delineating the situations that support long-term coexistence of the two types. We also discuss the case of various cycle graphs and we present computer simulations that perfectly match our analytical results.","lang":"eng"}],"volume":479,"file_date_updated":"2023-04-03T06:25:29Z","date_created":"2023-04-02T22:01:09Z","acknowledgement":"J.S. and K.C. acknowledge support from the ERC CoG 863818 (ForM-SMArt)","year":"2023","_id":"12787","oa":1,"publication_status":"published","has_accepted_license":"1","ddc":["000"],"date_published":"2023-03-29T00:00:00Z","external_id":{"isi":["000957125500002"]},"status":"public","intvolume":"       479","related_material":{"link":[{"url":"https://doi.org/10.6084/m9.figshare.21261771.v1","relation":"research_data"}]},"citation":{"ama":"Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. Coexistence times in the Moran process with environmental heterogeneity. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. 2023;479(2271). doi:<a href=\"https://doi.org/10.1098/rspa.2022.0685\">10.1098/rspa.2022.0685</a>","ista":"Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. 2023. Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 479(2271), 20220685.","mla":"Svoboda, Jakub, et al. “Coexistence Times in the Moran Process with Environmental Heterogeneity.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 479, no. 2271, 20220685, The Royal Society, 2023, doi:<a href=\"https://doi.org/10.1098/rspa.2022.0685\">10.1098/rspa.2022.0685</a>.","apa":"Svoboda, J., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2023). Coexistence times in the Moran process with environmental heterogeneity. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rspa.2022.0685\">https://doi.org/10.1098/rspa.2022.0685</a>","ieee":"J. Svoboda, J. Tkadlec, K. Kaveh, and K. Chatterjee, “Coexistence times in the Moran process with environmental heterogeneity,” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 479, no. 2271. The Royal Society, 2023.","chicago":"Svoboda, Jakub, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “Coexistence Times in the Moran Process with Environmental Heterogeneity.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. The Royal Society, 2023. <a href=\"https://doi.org/10.1098/rspa.2022.0685\">https://doi.org/10.1098/rspa.2022.0685</a>.","short":"J. Svoboda, J. Tkadlec, K. Kaveh, K. Chatterjee, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 479 (2023)."}}]