[{"has_accepted_license":"1","month":"07","day":"17","oa_version":"Published Version","ec_funded":1,"external_id":{"isi":["001310805600002"]},"abstract":[{"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.","lang":"eng"}],"publication_status":"published","related_material":{"link":[{"url":"https://github.com/boyvolcano/PRR","relation":"software"}]},"file_date_updated":"2023-09-20T08:24:47Z","date_published":"2023-07-17T00:00:00Z","volume":13966,"oa":1,"year":"2023","alternative_title":["LNCS"],"publisher":"Springer Nature","_id":"14318","file":[{"file_id":"14348","success":1,"relation":"main_file","checksum":"42917e086f8c7699f3bccf84f74fe000","access_level":"open_access","file_size":624647,"content_type":"application/pdf","date_created":"2023-09-20T08:24:47Z","file_name":"2023_LNCS_Sun.pdf","creator":"dernst","date_updated":"2023-09-20T08:24:47Z"}],"intvolume":"     13966","type":"conference","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","author":[{"full_name":"Sun, Yican","first_name":"Yican","last_name":"Sun"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"}],"date_created":"2023-09-10T22:01:12Z","department":[{"_id":"KrCh"}],"ddc":["000"],"isi":1,"scopus_import":"1","page":"16-39","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"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>","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>","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.","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>.","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.","short":"Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Computer Aided Verification, Springer Nature, 2023, pp. 16–39."},"publication":"Computer Aided Verification","status":"public","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","date_updated":"2025-09-09T12:55:28Z","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.","publication_identifier":{"isbn":["9783031377082"],"eissn":["1611-3349"],"issn":["0302-9743"]},"title":"Automated tail bound analysis for probabilistic recurrence relations"},{"alternative_title":["LIPIcs"],"arxiv":1,"date_published":"2023-08-21T00:00:00Z","volume":272,"oa":1,"year":"2023","related_material":{"record":[{"relation":"later_version","id":"17474","status":"public"}]},"file_date_updated":"2023-10-09T09:19:11Z","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"}],"publication_status":"published","oa_version":"Published Version","external_id":{"arxiv":["2307.06611"]},"ec_funded":1,"day":"21","has_accepted_license":"1","month":"08","date_created":"2023-10-09T09:21:05Z","author":[{"full_name":"Baier, Christel","last_name":"Baier","first_name":"Christel"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"full_name":"Piribauer, Jakob","first_name":"Jakob","last_name":"Piribauer"}],"doi":"10.4230/LIPIcs.MFCS.2023.15","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"intvolume":"       272","type":"conference","file":[{"checksum":"402281b17ed669bbf149d0fdf68ac201","success":1,"relation":"main_file","file_id":"14418","content_type":"application/pdf","access_level":"open_access","file_size":826843,"date_updated":"2023-10-09T09:19:11Z","creator":"dernst","file_name":"2023_LIPIcsMFCS_Baier.pdf","date_created":"2023-10-09T09:19:11Z"}],"_id":"14417","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","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>","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>.","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: 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>.","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."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication":"48th International Symposium on Mathematical Foundations of Computer Science","scopus_import":"1","ddc":["000"],"corr_author":"1","department":[{"_id":"KrCh"}],"title":"Entropic risk for turn-based stochastic games","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.","date_updated":"2025-09-08T09:10:05Z","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772921"]},"article_processing_charge":"Yes","article_number":"15","conference":{"start_date":"2023-08-28","location":"Bordeaux, France","end_date":"2023-09-01","name":"MFCS: Mathematical Foundations of Computer Science"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"page":"333-347","citation":{"apa":"Křišťan, J. M., &#38; Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In <i>24th International Symposium on Fundamentals of Computation Theory</i> (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-43587-4_24\">https://doi.org/10.1007/978-3-031-43587-4_24</a>","ama":"Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token sliding. In: <i>24th International Symposium on Fundamentals of Computation Theory</i>. Vol 14292. Springer Nature; 2023:333-347. doi:<a href=\"https://doi.org/10.1007/978-3-031-43587-4_24\">10.1007/978-3-031-43587-4_24</a>","ieee":"J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under token sliding,” in <i>24th International Symposium on Fundamentals of Computation Theory</i>, Trier, Germany, 2023, vol. 14292, pp. 333–347.","short":"J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals of Computation Theory, Springer Nature, 2023, pp. 333–347.","chicago":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” In <i>24th International Symposium on Fundamentals of Computation Theory</i>, 14292:333–47. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-43587-4_24\">https://doi.org/10.1007/978-3-031-43587-4_24</a>.","ista":"Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under token sliding. 24th International Symposium on Fundamentals of Computation Theory. FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.","mla":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” <i>24th International Symposium on Fundamentals of Computation Theory</i>, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:<a href=\"https://doi.org/10.1007/978-3-031-43587-4_24\">10.1007/978-3-031-43587-4_24</a>."},"publication":"24th International Symposium on Fundamentals of Computation Theory","isi":1,"scopus_import":"1","status":"public","department":[{"_id":"KrCh"}],"article_processing_charge":"No","title":"Shortest dominating set reconfiguration under token sliding","date_updated":"2025-09-09T13:07:40Z","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031435867"],"eissn":["1611-3349"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"conference":{"name":"FCT: Fundamentals of Computation Theory","location":"Trier, Germany","end_date":"2023-09-21","start_date":"2023-09-18"},"quality_controlled":"1","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/978-3-031-43587-4_31"}]},"abstract":[{"text":"In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets.","lang":"eng"}],"publication_status":"published","alternative_title":["LNCS"],"arxiv":1,"date_published":"2023-09-21T00:00:00Z","volume":14292,"year":"2023","oa":1,"month":"09","oa_version":"Preprint","external_id":{"isi":["001162288800024"],"arxiv":["2307.10847"]},"day":"21","intvolume":"     14292","type":"conference","author":[{"first_name":"Jan Matyáš","last_name":"Křišťan","full_name":"Křišťan, Jan Matyáš"},{"last_name":"Svoboda","first_name":"Jakub","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"}],"date_created":"2023-10-29T23:01:16Z","doi":"10.1007/978-3-031-43587-4_24","_id":"14456","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.10847","open_access":"1"}],"publisher":"Springer Nature"},{"type":"conference","intvolume":"       372","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"doi":"10.3233/FAIA230264","date_created":"2023-11-12T23:00:56Z","author":[{"last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Sadhukhan","first_name":"Suman","full_name":"Sadhukhan, Suman"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"}],"publisher":"IOS Press","_id":"14518","file":[{"relation":"main_file","success":1,"checksum":"1390ca38480fa4cf286b0f1a42e8c12f","file_id":"14529","content_type":"application/pdf","access_level":"open_access","file_size":501011,"date_updated":"2023-11-13T10:16:10Z","creator":"dernst","date_created":"2023-11-13T10:16:10Z","file_name":"2023_FAIA_Avni.pdf"}],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"file_date_updated":"2023-11-13T10:16:10Z","year":"2023","oa":1,"volume":372,"date_published":"2023-09-28T00:00:00Z","arxiv":1,"month":"09","has_accepted_license":"1","day":"28","external_id":{"arxiv":["2307.15218"]},"ec_funded":1,"oa_version":"Published Version","article_processing_charge":"No","publication_identifier":{"issn":["0922-6389"],"isbn":["9781643684369"]},"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.","date_updated":"2025-03-31T16:01:09Z","title":"Reachability poorman discrete-bidding games","quality_controlled":"1","conference":{"start_date":"2023-09-30","location":"Krakow, Poland","end_date":"2023-10-04","name":"ECAI: European Conference on Artificial Intelligence"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","publication":"Frontiers in Artificial Intelligence and Applications","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"page":"141-148","citation":{"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.","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>","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>","short":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.","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>.","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>."},"status":"public","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","corr_author":"1","ddc":["000"]},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2026-04-07T13:27:56Z","publication_identifier":{"isbn":["978-3-99078-036-7"],"issn":["2663-337X"]},"title":"Automated verification and control of infinite state stochastic systems","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"corr_author":"1","ddc":["000"],"degree_awarded":"PhD","page":"256","tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"citation":{"short":"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>.","ista":"Zikelic D. 2023. Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria.","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>.","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>","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>","ieee":"D. Zikelic, “Automated verification and control of infinite state stochastic systems,” Institute of Science and Technology Austria, 2023."},"status":"public","publisher":"Institute of Science and Technology Austria","supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"}],"_id":"14539","file":[{"date_updated":"2023-11-15T13:43:28Z","creator":"cchlebak","file_name":"main.pdf","date_created":"2023-11-15T13:43:28Z","checksum":"f23e002b0059ca78e1fbb864da52dd7e","relation":"main_file","success":1,"file_id":"14540","content_type":"application/pdf","file_size":2116426,"access_level":"open_access"},{"date_updated":"2023-11-15T13:44:24Z","file_name":"thesis_source.zip","date_created":"2023-11-15T13:44:24Z","creator":"cchlebak","content_type":"application/x-zip-compressed","file_size":35884057,"access_level":"closed","relation":"source_file","checksum":"80ca37618a3c7b59866875f8be9b15ed","file_id":"14541"}],"type":"dissertation","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"doi":"10.15479/14539","date_created":"2023-11-15T13:39:10Z","author":[{"last_name":"Zikelic","first_name":"Dorde","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"month":"11","day":"15","OA_place":"publisher","oa_version":"Published Version","ec_funded":1,"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"}],"publication_status":"published","related_material":{"record":[{"id":"10414","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"12000","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9644"},{"id":"12511","status":"public","relation":"part_of_dissertation"},{"id":"14600","status":"public","relation":"part_of_dissertation"},{"id":"14601","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"1194","status":"public"}]},"file_date_updated":"2023-11-15T13:44:24Z","date_published":"2023-11-15T00:00:00Z","year":"2023","oa":1,"alternative_title":["ISTA Thesis"]},{"publication":"21st International Symposium on Automated Technology for Verification and Analysis","page":"357-379","citation":{"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.","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>","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.","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>.","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.","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>."},"scopus_import":"1","isi":1,"status":"public","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"corr_author":"1","article_processing_charge":"No","title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031453281"],"issn":["0302-9743"]},"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_updated":"2025-09-09T13:20:26Z","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"start_date":"2023-10-24","name":"ATVA: Automated Technology for Verification and Analysis","location":"Singapore, Singapore","end_date":"2023-10-27"},"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","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."}],"arxiv":1,"alternative_title":["LNCS"],"year":"2023","oa":1,"date_published":"2023-10-22T00:00:00Z","volume":14215,"month":"10","external_id":{"isi":["001456127300017"],"arxiv":["2210.05304"]},"ec_funded":1,"oa_version":"Preprint","day":"22","type":"conference","intvolume":"     14215","author":[{"last_name":"Ansaripour","first_name":"Matin","full_name":"Ansaripour, Matin"},{"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","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zikelic","first_name":"Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"date_created":"2023-11-19T23:00:56Z","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"doi":"10.1007/978-3-031-45329-8_17","_id":"14559","publisher":"Springer Nature","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2210.05304","open_access":"1"}]},{"department":[{"_id":"KrCh"},{"_id":"KrPi"}],"citation":{"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>.","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>.","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.","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.","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>","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>","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."},"page":"309-325","publication":"27th International Conference on Financial Cryptography and Data Security","isi":1,"scopus_import":"1","status":"public","OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2023-05-01","name":"FC: Financial Cryptography and Data Security","location":"Bol, Brac, Croatia","end_date":"2023-05-05"},"language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","title":"R2: Boosting liquidity in payment channel networks with online admission control","date_updated":"2025-11-05T07:37:31Z","acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","publication_identifier":{"isbn":["9783031477539"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031477546"]},"month":"12","oa_version":"Submitted Version","external_id":{"isi":["001150222600018"]},"ec_funded":1,"day":"01","OA_place":"repository","abstract":[{"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.","lang":"eng"}],"publication_status":"published","alternative_title":["LNCS"],"volume":13950,"date_published":"2023-12-01T00:00:00Z","oa":1,"year":"2023","_id":"14736","main_file_link":[{"url":"https://openreview.net/forum?id=Dg0qdd9uha","open_access":"1"}],"publisher":"Springer Nature","type":"conference","intvolume":"     13950","author":[{"first_name":"Mahsa","last_name":"Bastankhah","full_name":"Bastankhah, Mahsa"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Mohammad Ali","last_name":"Maddah-Ali","full_name":"Maddah-Ali, Mohammad Ali"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"last_name":"Svoboda","first_name":"Jakub","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"first_name":"Michelle X","last_name":"Yeo","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809"}],"date_created":"2024-01-08T09:30:22Z","doi":"10.1007/978-3-031-47754-6_18","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}]},{"status":"public","keyword":["Theoretical Computer Science","Software"],"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>","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.","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>.","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.","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>.","short":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, Formal Aspects of Computing 35 (2023)."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication":"Formal Aspects of Computing","isi":1,"scopus_import":"1","ddc":["000"],"corr_author":"1","issue":"2","department":[{"_id":"KrCh"}],"title":"On lexicographic proof rules for probabilistic termination","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.","date_updated":"2025-09-09T14:19:27Z","publication_identifier":{"eissn":["1433-299X"],"issn":["0934-5043"]},"article_processing_charge":"Yes","article_number":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"quality_controlled":"1","arxiv":1,"volume":35,"date_published":"2023-06-23T00:00:00Z","year":"2023","oa":1,"related_material":{"record":[{"id":"10414","status":"public","relation":"earlier_version"}]},"file_date_updated":"2024-01-16T08:11:24Z","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"}],"publication_status":"published","article_type":"original","oa_version":"Published Version","external_id":{"arxiv":["2108.02188"],"isi":["001035915800006"]},"ec_funded":1,"day":"23","has_accepted_license":"1","month":"06","date_created":"2024-01-10T09:27:43Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Kafshdar Goharshady","first_name":"Ehsan","full_name":"Kafshdar Goharshady, Ehsan"},{"first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jiří","last_name":"Zárevúcky","full_name":"Zárevúcky, Jiří"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"}],"doi":"10.1145/3585391","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"intvolume":"        35","type":"journal_article","file":[{"date_updated":"2024-01-16T08:11:24Z","creator":"dernst","date_created":"2024-01-16T08:11:24Z","file_name":"2023_FormalAspectsComputing_Chatterjee.pdf","content_type":"application/pdf","file_size":502522,"access_level":"open_access","checksum":"3bb133eeb27ec01649a9a36445d952d9","relation":"main_file","success":1,"file_id":"14804"}],"_id":"14778","publisher":"Association for Computing Machinery"},{"_id":"14830","publisher":"Association for the Advancement of Artificial Intelligence","main_file_link":[{"url":"https://arxiv.org/abs/2210.05308","open_access":"1"}],"date_created":"2024-01-18T07:44:31Z","author":[{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"doi":"10.1609/aaai.v37i10.26407","type":"conference","intvolume":"        37","ec_funded":1,"external_id":{"arxiv":["2210.05308"]},"oa_version":"Preprint","OA_place":"repository","day":"26","month":"06","arxiv":1,"oa":1,"year":"2023","volume":37,"date_published":"2023-06-26T00:00:00Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"14600"}]},"publication_status":"published","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"start_date":"2023-02-07","location":"Washington, DC, United States","end_date":"2023-02-14","name":"AAAI: Conference on Artificial Intelligence"},"quality_controlled":"1","OA_type":"green","title":"Learning control policies for stochastic systems with reach-avoid guarantees","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"]},"date_updated":"2025-07-03T11:38:12Z","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.","article_processing_charge":"No","issue":"10","corr_author":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"keyword":["General Medicine"],"status":"public","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","page":"11926-11935","citation":{"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>","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>","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.","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>.","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>.","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."},"scopus_import":"1"},{"oa":1,"year":"2023","date_published":"2023-01-18T00:00:00Z","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"apa":"Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>","ama":"Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.","chicago":"Meggendorfer, Tobias. “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>.","ista":"Meggendorfer T. 2023. Artefact for: Correct Approximation of Stationary Distributions, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","mla":"Meggendorfer, Tobias. <i>Artefact for: Correct Approximation of Stationary Distributions</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","short":"T. Meggendorfer, (2023)."},"related_material":{"record":[{"relation":"used_in_publication","id":"13139","status":"public"}]},"abstract":[{"lang":"eng","text":"The software artefact to evaluate the approximation of stationary distributions implementation."}],"oa_version":"Published Version","day":"18","corr_author":"1","ddc":["000"],"department":[{"_id":"KrCh"}],"month":"01","has_accepted_license":"1","author":[{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"}],"title":"Artefact for: Correct Approximation of Stationary Distributions","date_created":"2024-02-14T14:27:06Z","doi":"10.5281/ZENODO.7548214","date_updated":"2025-09-09T12:28:12Z","article_processing_charge":"No","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14990","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"publisher":"Zenodo"},{"article_processing_charge":"No","article_number":"2304.04024","type":"preprint","date_created":"2024-06-03T07:44:54Z","title":"Prophet inequalities: Separating random order from order selection","author":[{"first_name":"Giordano","last_name":"Giambartolomei","full_name":"Giambartolomei, Giordano"},{"last_name":"Frederik Mallmann-Trenn","first_name":"Frederik Mallmann-Trenn","full_name":"Frederik Mallmann-Trenn, Frederik Mallmann-Trenn"},{"last_name":"Saona Urmeneta","first_name":"Raimundo J","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"}],"acknowledgement":"This research was partially supported by the EPSRC grant EP/W005573/1, the ERC CoG 863818 (ForM-SMArt) grant, and the ANID Chile grant ACT210005. We would like to thank Jos´e Correa and Bruno Zilotto for their precious advice, and Mona Mohammadi and Roodabeh Safavi for early conversations.","date_updated":"2025-04-14T07:52:47Z","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"doi":"10.48550/arXiv.2304.04024","_id":"17100","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.04024"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Giambartolomei, Giordano, Frederik Mallmann-Trenn Frederik Mallmann-Trenn, and Raimundo J Saona Urmeneta. “Prophet Inequalities: Separating Random Order from Order Selection.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2304.04024\">https://doi.org/10.48550/arXiv.2304.04024</a>.","ista":"Giambartolomei G, Frederik Mallmann-Trenn FM-T, Saona Urmeneta RJ. Prophet inequalities: Separating random order from order selection. arXiv, 2304.04024.","mla":"Giambartolomei, Giordano, et al. “Prophet Inequalities: Separating Random Order from Order Selection.” <i>ArXiv</i>, 2304.04024, doi:<a href=\"https://doi.org/10.48550/arXiv.2304.04024\">10.48550/arXiv.2304.04024</a>.","short":"G. Giambartolomei, F.M.-T. Frederik Mallmann-Trenn, R.J. Saona Urmeneta, ArXiv (n.d.).","apa":"Giambartolomei, G., Frederik Mallmann-Trenn, F. M.-T., &#38; Saona Urmeneta, R. J. (n.d.). Prophet inequalities: Separating random order from order selection. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2304.04024\">https://doi.org/10.48550/arXiv.2304.04024</a>","ama":"Giambartolomei G, Frederik Mallmann-Trenn FM-T, Saona Urmeneta RJ. Prophet inequalities: Separating random order from order selection. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2304.04024\">10.48550/arXiv.2304.04024</a>","ieee":"G. Giambartolomei, F. M.-T. Frederik Mallmann-Trenn, and R. J. Saona Urmeneta, “Prophet inequalities: Separating random order from order selection,” <i>arXiv</i>. ."},"publication":"arXiv","abstract":[{"text":"Prophet inequalities are a central object of study in optimal stopping theory. A gambler is sent values online, sampled from an instance of independent distributions, in an adversarial, random or selected order, depending on the model. When observing each value, the gambler either accepts it as a reward or irrevocably rejects it and proceeds to observe the next value. The goal of the gambler, who cannot see the future, is maximising the expected value of the reward while competing against the expectation of a prophet (the offline maximum). In other words, one seeks to maximise the gambler-to-prophet ratio of the expectations.\r\nThe model, in which the gambler selects the arrival order first, and then observes the values, is known as Order Selection. In this model a ratio of 0.7251 has been proved to be attainable for any instance. In very recent work, this has been improved up to 0.7258. If the gambler chooses the arrival order (uniformly) at random, we obtain the Random Order model. The worst case ratio over all possible instances has been extensively studied for at least 40 years. In the recent work aforementioned, through simulations, this ratio has been shown to be at most 0.7254 for the Random Order model, thus establishing for the first time that carefully choosing the order, instead of simply taking it at random, benefits the gambler. We give an alternative, more rigorous proof of this fact, by showing mathematically that in the Random Order model, no algorithm can achieve a ratio larger than 0.7235. This sets a new state-of-the-art hardness for this model, and establishes more formally that there is a real benefit in choosing the order.","lang":"eng"}],"publication_status":"submitted","arxiv":1,"date_published":"2023-04-08T00:00:00Z","status":"public","oa":1,"year":"2023","department":[{"_id":"KrCh"}],"month":"04","oa_version":"Preprint","external_id":{"arxiv":["2304.04024"]},"ec_funded":1,"day":"08"},{"title":"Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation","date_updated":"2025-12-02T14:02:38Z","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.","publication_identifier":{"eisbn":["9783031327339"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031327322"]},"article_processing_charge":"No","conference":{"name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity","location":"Alcalá de Henares, Spain","end_date":"2023-06-09","start_date":"2023-06-06"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","OA_type":"closed access","status":"public","page":"576-594","citation":{"ama":"Schmid S, Svoboda J, Yeo MX. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: <i>30th International Colloquium on 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>","apa":"Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In <i>30th International Colloquium on Structural Information and Communication Complexity</i> (Vol. 13892, pp. 576–594). Alcalá 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>","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in <i>30th International Colloquium on Structural Information and Communication Complexity</i>, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 576–594.","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In <i>30th International Colloquium on 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>.","ista":"Schmid S, Svoboda J, Yeo MX. 2023. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. 30th International Colloquium on Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 13892, 576–594.","mla":"Schmid, Stefan, et al. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” <i>30th International Colloquium on 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>.","short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 576–594."},"publication":"30th International Colloquium on Structural Information and Communication Complexity","isi":1,"scopus_import":"1","corr_author":"1","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"date_created":"2025-07-10T13:15:43Z","author":[{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub"},{"last_name":"Yeo","first_name":"Michelle X","orcid":"0009-0001-3676-4809","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1007/978-3-031-32733-9_26","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"intvolume":"     13892","type":"conference","_id":"19985","publisher":"Springer Nature","alternative_title":["LNCS"],"date_published":"2023-05-25T00:00:00Z","volume":13892,"year":"2023","related_material":{"record":[{"relation":"later_version","id":"14820","status":"public"}]},"abstract":[{"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 + E) . (1 + square3) for some arbitrary E>0.","lang":"eng"}],"publication_status":"published","oa_version":"None","external_id":{"isi":["001292782600026"]},"ec_funded":1,"day":"25","month":"05"},{"ddc":["000"],"department":[{"_id":"KrCh"}],"status":"public","page":"231-264","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"apa":"Graham, T., Kleshnina, M., &#38; Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. <i>Dynamic Games and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s13235-022-00425-3\">https://doi.org/10.1007/s13235-022-00425-3</a>","ama":"Graham T, Kleshnina M, Filar JA. Where do mistakes lead? A survey of games with incompetent players. <i>Dynamic Games and Applications</i>. 2023;13:231-264. doi:<a href=\"https://doi.org/10.1007/s13235-022-00425-3\">10.1007/s13235-022-00425-3</a>","ieee":"T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” <i>Dynamic Games and Applications</i>, vol. 13. Springer Nature, pp. 231–264, 2023.","chicago":"Graham, Thomas, Maria Kleshnina, and Jerzy A. Filar. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” <i>Dynamic Games and Applications</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s13235-022-00425-3\">https://doi.org/10.1007/s13235-022-00425-3</a>.","ista":"Graham T, Kleshnina M, Filar JA. 2023. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 13, 231–264.","mla":"Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” <i>Dynamic Games and Applications</i>, vol. 13, Springer Nature, 2023, pp. 231–64, doi:<a href=\"https://doi.org/10.1007/s13235-022-00425-3\">10.1007/s13235-022-00425-3</a>.","short":"T. Graham, M. Kleshnina, J.A. Filar, Dynamic Games and Applications 13 (2023) 231–264."},"publication":"Dynamic Games and Applications","isi":1,"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"Where do mistakes lead? A survey of games with incompetent players","date_updated":"2025-04-14T07:43:48Z","acknowledgement":"The authors would like to acknowledge stimulating email discussions with Dr Wayne Lobb of W.A. Lobb LLC on the topic of evolutionary games. We also thank Dr Thomas Taimre for his input to the material in Sect. 3.\r\nThe authors would like to acknowledge partial support from the Australian Research Council under the Discovery grant DP180101602 and support by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411.","publication_identifier":{"issn":["2153-0785"],"eissn":["2153-0793"]},"article_processing_charge":"No","oa_version":"Published Version","external_id":{"isi":["000753777100001"]},"ec_funded":1,"day":"01","has_accepted_license":"1","month":"03","volume":13,"date_published":"2023-03-01T00:00:00Z","oa":1,"year":"2023","file_date_updated":"2022-02-21T08:54:17Z","abstract":[{"lang":"eng","text":"Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings."}],"publication_status":"published","article_type":"original","file":[{"file_name":"2022_DynamicGamesApplic_Graham.pdf","date_created":"2022-02-21T08:54:17Z","creator":"dernst","date_updated":"2022-02-21T08:54:17Z","access_level":"open_access","file_size":1890512,"content_type":"application/pdf","file_id":"10781","success":1,"checksum":"cd53b07e96f9030ddb348f305e5b58c7","relation":"main_file"}],"_id":"10770","publisher":"Springer Nature","author":[{"last_name":"Graham","first_name":"Thomas","full_name":"Graham, Thomas"},{"full_name":"Kleshnina, Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","last_name":"Kleshnina","first_name":"Maria"},{"full_name":"Filar, Jerzy A.","first_name":"Jerzy A.","last_name":"Filar"}],"date_created":"2022-02-20T23:01:32Z","doi":"10.1007/s13235-022-00425-3","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"intvolume":"        13","type":"journal_article"},{"article_processing_charge":"No","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.","date_updated":"2026-07-07T06:24:15Z","publication_identifier":{"isbn":["9781577358800"]},"title":"Bidding graph games with partially-observable budgets","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2023-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","location":"Washington, DC, United States"},"scopus_import":"1","page":"5464-5471","citation":{"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: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>","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. AAAI Press; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","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. AAAI Press, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/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, AAAI Press, 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.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI Press, 2023, pp. 5464–5471."},"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","status":"public","das_tickbox":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ddc":["000"],"issue":"5","intvolume":"        37","type":"conference","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"doi":"10.1609/aaai.v37i5.25679","date_created":"2023-08-27T22:01:18Z","author":[{"first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R"},{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}],"publisher":"AAAI Press","_id":"14243","abstract":[{"lang":"eng","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."}],"publication_status":"published","date_published":"2023-06-27T00:00:00Z","volume":37,"year":"2023","oa":1,"arxiv":1,"month":"06","day":"27","oa_version":"Published Version","external_id":{"arxiv":["2211.13626"]},"ec_funded":1},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"corr_author":"1","ddc":["000"],"citation":{"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>. Neural Information Processing Systems Foundation, 2023.","mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 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, Advances in Neural Information Processing Systems, .","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","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: Neural Information Processing Systems Foundation.","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>. Neural Information Processing Systems Foundation; 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."},"publication":"37th Conference on Neural Information Processing Systems","das_tickbox":"1","status":"public","conference":{"start_date":"2023-12-10","end_date":"2023-12-16","location":"New Orleans, LO, United States","name":"NeurIPS: Neural Information Processing Systems"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","article_processing_charge":"No","title":"Compositional policy learning in stochastic control systems with formal guarantees","date_updated":"2026-07-07T06:36:54Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","publication_identifier":{"eissn":["1049-5258"]},"has_accepted_license":"1","month":"12","oa_version":"Published Version","external_id":{"arxiv":["2312.01456"]},"ec_funded":1,"day":"15","file_date_updated":"2024-07-22T11:45:17Z","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."}],"publication_status":"published","alternative_title":["Advances in Neural Information Processing Systems"],"arxiv":1,"date_published":"2023-12-15T00:00:00Z","oa":1,"year":"2023","_id":"15023","publisher":"Neural Information Processing Systems Foundation","file":[{"creator":"dernst","file_name":"2023_NeurIPS_Zikelic.pdf","date_created":"2024-07-22T11:45:17Z","date_updated":"2024-07-22T11:45:17Z","file_id":"17309","success":1,"relation":"main_file","checksum":"739c6d72506b778302d4e708723bf12c","access_level":"open_access","file_size":562008,"content_type":"application/pdf"}],"type":"conference","date_created":"2024-02-25T09:23:24Z","author":[{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"first_name":"Abhinav","last_name":"Verma","full_name":"Verma, Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}]},{"file_date_updated":"2023-09-06T08:25:50Z","publication_status":"published","abstract":[{"lang":"eng","text":"We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning."}],"alternative_title":["LNCS"],"oa":1,"year":"2023","volume":13964,"date_published":"2023-07-17T00:00:00Z","month":"07","has_accepted_license":"1","external_id":{"isi":["001310786500020"]},"oa_version":"Published Version","day":"17","type":"conference","intvolume":"     13964","date_created":"2023-09-03T22:01:16Z","author":[{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"full_name":"Prokop, Maximilian","first_name":"Maximilian","last_name":"Prokop"},{"full_name":"Rieder, Sabine","first_name":"Sabine","last_name":"Rieder"}],"doi":"10.1007/978-3-031-37706-8_20","_id":"14259","publisher":"Springer Nature","file":[{"creator":"dernst","file_name":"2023_LNCS_CAV_Kretinsky.pdf","date_created":"2023-09-06T08:25:50Z","date_updated":"2023-09-06T08:25:50Z","file_id":"14276","checksum":"ed66278b61bb869e1baba3d9b9081271","relation":"main_file","success":1,"file_size":428354,"access_level":"open_access","content_type":"application/pdf"}],"publication":"35th International Conference on Computer Aided Verification","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"page":"390-414","citation":{"ieee":"J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13964, pp. 390–414.","apa":"Kretinsky, J., Meggendorfer, T., Prokop, M., &#38; Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">https://doi.org/10.1007/978-3-031-37706-8_20</a>","ama":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13964. Springer Nature; 2023:390-414. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">10.1007/978-3-031-37706-8_20</a>","ista":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies in LTL synthesis by semantic learning. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414.","mla":"Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13964, Springer Nature, 2023, pp. 390–414, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">10.1007/978-3-031-37706-8_20</a>.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In <i>35th International Conference on Computer Aided Verification</i>, 13964:390–414. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">https://doi.org/10.1007/978-3-031-37706-8_20</a>.","short":"J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 390–414."},"scopus_import":"1","isi":1,"das_tickbox":"1","status":"public","department":[{"_id":"KrCh"}],"ddc":["000"],"article_processing_charge":"Yes (in subscription journal)","title":"Guessing winning policies in LTL synthesis by semantic learning","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031377051"],"issn":["0302-9743"]},"acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).","date_updated":"2026-07-07T13:39:23Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"quality_controlled":"1"},{"file_date_updated":"2023-04-03T06:25:29Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20138"}],"link":[{"relation":"research_data","url":"https://doi.org/10.6084/m9.figshare.21261771.v1"}]},"article_type":"original","publication_status":"published","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"}],"year":"2023","oa":1,"volume":479,"date_published":"2023-03-29T00:00:00Z","month":"03","has_accepted_license":"1","ec_funded":1,"external_id":{"isi":["000957125500002"]},"oa_version":"Published Version","day":"29","type":"journal_article","intvolume":"       479","date_created":"2023-04-02T22:01:09Z","author":[{"first_name":"Jakub","last_name":"Svoboda","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267"},{"first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"full_name":"Kaveh, Kamran","last_name":"Kaveh","first_name":"Kamran"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"}],"doi":"10.1098/rspa.2022.0685","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"_id":"12787","publisher":"The Royal Society","file":[{"file_id":"12796","checksum":"13953d349fbefcb5d21ccc6b303297eb","relation":"main_file","success":1,"file_size":827784,"access_level":"open_access","content_type":"application/pdf","date_created":"2023-04-03T06:25:29Z","file_name":"2023_ProceedingsRoyalSocietyA_Svoboda.pdf","creator":"dernst","date_updated":"2023-04-03T06:25:29Z"}],"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"short":"J. Svoboda, J. Tkadlec, K. Kaveh, K. Chatterjee, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 479 (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>.","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>","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>","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."},"scopus_import":"1","isi":1,"status":"public","department":[{"_id":"KrCh"}],"issue":"2271","ddc":["000"],"article_processing_charge":"No","article_number":"20220685","title":"Coexistence times in the Moran process with environmental heterogeneity","publication_identifier":{"issn":["1364-5021"],"eissn":["1471-2946"]},"date_updated":"2026-07-27T12:52:03Z","acknowledgement":"J.S. and K.C. acknowledge support from the ERC CoG 863818 (ForM-SMArt)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"quality_controlled":"1"},{"status":"public","scopus_import":"1","isi":1,"publication":"38th Annual ACM/IEEE Symposium on Logic in Computer Science","citation":{"short":"J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 38th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2023.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, and Maximilian Weininger. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.” In <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Vol. 2023. IEEE, 2023. <a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">https://doi.org/10.1109/LICS56636.2023.10175771</a>.","ista":"Kretinsky J, Meggendorfer T, Weininger M. 2023. Stopping criteria for value iteration on stochastic games with quantitative objectives. 38th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2023.","mla":"Kretinsky, Jan, et al. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.” <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, vol. 2023, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">10.1109/LICS56636.2023.10175771</a>.","apa":"Kretinsky, J., Meggendorfer, T., &#38; Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (Vol. 2023). Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">https://doi.org/10.1109/LICS56636.2023.10175771</a>","ama":"Kretinsky J, Meggendorfer T, Weininger M. Stopping criteria for value iteration on stochastic games with quantitative objectives. In: <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Vol 2023. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">10.1109/LICS56636.2023.10175771</a>","ieee":"J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Boston, MA, United States, 2023, vol. 2023."},"corr_author":"1","department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["9798350335873"],"issn":["1043-6871"]},"acknowledgement":"This research was funded in part by DFG projects 383882557 “SUV” and 427755713 “GOPro”.","date_updated":"2026-08-12T06:39:58Z","title":"Stopping criteria for value iteration on stochastic games with quantitative objectives","article_processing_charge":"No","quality_controlled":"1","conference":{"start_date":"2023-06-26","location":"Boston, MA, United States","end_date":"2023-06-29","name":"LICS: Logic in Computer Science"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"year":"2023","oa":1,"volume":2023,"date_published":"2023-07-01T00:00:00Z","arxiv":1,"publication_status":"published","abstract":[{"text":"A classic solution technique for Markov decision processes (MDP) and stochastic games (SG) is value iteration (VI). Due to its good practical performance, this approximative approach is typically preferred over exact techniques, even though no practical bounds on the imprecision of the result could be given until recently. As a consequence, even the most used model checkers could return arbitrarily wrong results. Over the past decade, different works derived stopping criteria, indicating when the precision reaches the desired level, for various settings, in particular MDP with reachability, total reward, and mean payoff, and SG with reachability.In this paper, we provide the first stopping criteria for VI on SG with total reward and mean payoff, yielding the first anytime algorithms in these settings. To this end, we provide the solution in two flavours: First through a reduction to the MDP case and second directly on SG. The former is simpler and automatically utilizes any advances on MDP. The latter allows for more local computations, heading towards better practical efficiency.Our solution unifies the previously mentioned approaches for MDP and SG and their underlying ideas. To achieve this, we isolate objective-specific subroutines as well as identify objective-independent concepts. These structural concepts, while surprisingly simple, form the very essence of the unified solution.","lang":"eng"}],"day":"01","external_id":{"arxiv":["2304.09930"],"isi":["001036707700042"]},"oa_version":"Preprint","month":"07","doi":"10.1109/LICS56636.2023.10175771","author":[{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan"},{"orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias"},{"orcid":"0000-0002-0163-2152","id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"}],"date_created":"2023-08-06T22:01:10Z","type":"conference","intvolume":"      2023","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.09930"}],"publisher":"IEEE","_id":"13967"},{"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).","date_updated":"2026-08-12T14:05:25Z","publication_identifier":{"eissn":["1742-5662"]},"title":"Evolutionary dynamics of mutants that modify population structure","article_number":"20230355","article_processing_charge":"Yes (in subscription journal)","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"status":"public","isi":1,"scopus_import":"1","citation":{"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. Royal Society, 2023.","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>. 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>","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, 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.","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>. Royal Society, 2023. <a href=\"https://doi.org/10.1098/rsif.2023.0355\">https://doi.org/10.1098/rsif.2023.0355</a>.","short":"J. Tkadlec, K. Kaveh, K. Chatterjee, M.A. Nowak, Journal of the Royal Society Interface 20 (2023)."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication":"Journal of the Royal Society Interface","ddc":["000","570"],"issue":"208","department":[{"_id":"KrCh"}],"pmid":1,"doi":"10.1098/rsif.2023.0355","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"author":[{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef"},{"full_name":"Kaveh, Kamran","first_name":"Kamran","last_name":"Kaveh"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin A.","last_name":"Nowak","full_name":"Nowak, Martin A."}],"date_created":"2023-12-10T23:00:58Z","intvolume":"        20","type":"journal_article","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":1720243,"relation":"main_file","checksum":"2eefab13127c7786dbd33303c482a004","success":1,"file_id":"14673","date_updated":"2023-12-11T11:10:32Z","date_created":"2023-12-11T11:10:32Z","file_name":"2023_RoyalInterface_Tkadlec.pdf","creator":"dernst"}],"publisher":"Royal Society","_id":"14657","volume":20,"date_published":"2023-11-29T00:00:00Z","year":"2023","oa":1,"abstract":[{"lang":"eng","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."}],"article_type":"original","publication_status":"published","file_date_updated":"2023-12-11T11:10:32Z","day":"29","oa_version":"Published Version","external_id":{"isi":["001124419300002"],"pmid":["38016637"]},"ec_funded":1,"has_accepted_license":"1","month":"11"},{"article_processing_charge":"No","title":"Graph planning with expected finite horizon","publication_identifier":{"eissn":["1090-2724"],"issn":["0022-0000"]},"acknowledgement":"This work was partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407 and by the grant ERC CoG 863818 (ForM-SMArt).","date_updated":"2025-07-10T11:54:34Z","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","publication":"Journal of Computer and System Sciences","page":"1-21","citation":{"apa":"Chatterjee, K., &#38; Doyen, L. (2022). Graph planning with expected finite horizon. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">https://doi.org/10.1016/j.jcss.2022.04.003</a>","ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. <i>Journal of Computer and System Sciences</i>. 2022;129:1-21. doi:<a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">10.1016/j.jcss.2022.04.003</a>","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” <i>Journal of Computer and System Sciences</i>, vol. 129. Elsevier, pp. 1–21, 2022.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">https://doi.org/10.1016/j.jcss.2022.04.003</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>Journal of Computer and System Sciences</i>, vol. 129, Elsevier, 2022, pp. 1–21, doi:<a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">10.1016/j.jcss.2022.04.003</a>.","ista":"Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.","short":"K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21."},"scopus_import":"1","isi":1,"status":"public","department":[{"_id":"KrCh"}],"intvolume":"       129","type":"journal_article","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"date_created":"2022-05-22T22:01:40Z","doi":"10.1016/j.jcss.2022.04.003","project":[{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"_id":"11402","publisher":"Elsevier","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1802.03642","open_access":"1"}],"related_material":{"record":[{"id":"7402","status":"public","relation":"earlier_version"}]},"article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"Fixed-horizon planning considers a weighted graph and asks to construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping-time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary as the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping-time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time."}],"arxiv":1,"oa":1,"year":"2022","date_published":"2022-11-01T00:00:00Z","volume":129,"month":"11","ec_funded":1,"external_id":{"isi":["000805002800001"],"arxiv":["1802.03642"]},"oa_version":"Preprint","day":"01"}]