[{"volume":250,"acknowledgement":"The research was partially supported by the Hong Kong Research Grants Council ECS\r\nProject No. 26208122, ERC CoG 863818 (FoRM-SMArt), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, HKUST– Kaisa Joint Research Institute Project Grant HKJRI3A-055 and HKUST Startup Grant R9272. Ali Ahmadi and Roodabeh Safavi were interns at HKUST.","ddc":["000"],"doi":"10.4230/LIPIcs.FSTTCS.2022.29","day":"14","abstract":[{"text":"Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset.","lang":"eng"}],"date_updated":"2025-07-14T09:09:55Z","citation":{"apa":"Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., &#38; Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29</a>","ama":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">10.4230/LIPIcs.FSTTCS.2022.29</a>","chicago":"Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29</a>.","ieee":"A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Madras, India, 2022, vol. 250.","short":"A. Ahmadi, K. Chatterjee, A.K. Goharshady, T. Meggendorfer, R. Safavi Hemami, D. Zikelic, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">10.4230/LIPIcs.FSTTCS.2022.29</a>.","ista":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29."},"year":"2022","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","ec_funded":1,"file_date_updated":"2023-01-20T10:39:44Z","publication_status":"published","date_created":"2023-01-01T23:00:50Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"article_processing_charge":"No","title":"Algorithms and hardness results for computing cores of Markov chains","intvolume":"       250","_id":"12102","scopus_import":"1","author":[{"full_name":"Ahmadi, Ali","last_name":"Ahmadi","first_name":"Ali"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","full_name":"Safavi Hemami, Roodabeh","last_name":"Safavi Hemami","first_name":"Roodabeh"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"file":[{"date_updated":"2023-01-20T10:39:44Z","content_type":"application/pdf","file_name":"2022_LIPICs_Ahmadi.pdf","date_created":"2023-01-20T10:39:44Z","checksum":"6660c802489013f034c9e8bd57f4d46e","file_size":872534,"file_id":"12324","creator":"dernst","relation":"main_file","success":1,"access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"isbn":["9783959772617"],"issn":["1868-8969"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-12-14T00:00:00Z","type":"conference","conference":{"name":"FSTTC: Foundations of Software Technology and Theoretical Computer Science","start_date":"2022-12-18","location":"Madras, India","end_date":"2022-12-20"},"language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"month":"12","article_number":"29","publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","has_accepted_license":"1"},{"date_published":"2022-10-21T00:00:00Z","type":"conference","publication_identifier":{"isbn":["9783031199912"],"eisbn":["9783031199929"],"issn":["0302-9743"],"eissn":["1611-3349"]},"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication":"20th International Symposium on Automated Technology for Verification and Analysis","month":"10","oa_version":"None","language":[{"iso":"eng"}],"conference":{"end_date":"2022-10-28","location":"Virtual","start_date":"2022-10-25","name":"ATVA: Automated Technology for Verification and Analysis"},"date_updated":"2023-09-05T15:11:51Z","citation":{"ama":"Meggendorfer T. PET – A partial exploration tool for probabilistic verification. In: <i>20th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 13505. Springer Nature; 2022:320-326. doi:<a href=\"https://doi.org/10.1007/978-3-031-19992-9_20\">10.1007/978-3-031-19992-9_20</a>","apa":"Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In <i>20th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 13505, pp. 320–326). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19992-9_20\">https://doi.org/10.1007/978-3-031-19992-9_20</a>","chicago":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” In <i>20th International Symposium on Automated Technology for Verification and Analysis</i>, 13505:320–26. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19992-9_20\">https://doi.org/10.1007/978-3-031-19992-9_20</a>.","ieee":"T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in <i>20th International Symposium on Automated Technology for Verification and Analysis</i>, Virtual, 2022, vol. 13505, pp. 320–326.","short":"T. Meggendorfer, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 320–326.","mla":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” <i>20th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:<a href=\"https://doi.org/10.1007/978-3-031-19992-9_20\">10.1007/978-3-031-19992-9_20</a>.","ista":"Meggendorfer T. 2022. PET – A partial exploration tool for probabilistic verification. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 320–326."},"year":"2022","abstract":[{"text":"We present PET, a specialized and highly optimized framework for partial exploration on probabilistic systems. Over the last decade, several significant advances in the analysis of Markov decision processes employed partial exploration. In a nutshell, this idea allows to focus computation on specific parts of the system, guided by heuristics, while maintaining correctness. In particular, only relevant parts of the system are constructed on demand, which in turn potentially allows to omit constructing large parts of the system. Depending on the model, this leads to dramatic speed-ups, in extreme cases even up to an arbitrary factor. PET unifies several previous implementations and provides a flexible framework to easily implement partial exploration for many further problems. Our experimental evaluation shows significant improvements compared to the previous implementations while vastly reducing the overhead required to add support for additional properties.","lang":"eng"}],"doi":"10.1007/978-3-031-19992-9_20","day":"21","acknowledgement":"We thank Pranav Ashok and Maximilian Weininger for their contributions to spiritual predecessors of PET as well as motivating the initial development of this tool.","volume":13505,"author":[{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer"}],"_id":"12170","scopus_import":"1","title":"PET – A partial exploration tool for probabilistic verification","alternative_title":["LNCS"],"intvolume":"     13505","publication_status":"published","article_processing_charge":"No","date_created":"2023-01-12T12:11:07Z","department":[{"_id":"KrCh"}],"page":"320-326","quality_controlled":"1","publisher":"Springer Nature"},{"intvolume":"       106","title":"Social balance on networks: Local minima and best-edge dynamics","department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2023-01-16T09:57:57Z","publication_status":"published","issue":"3","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda"},{"last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"}],"scopus_import":"1","_id":"12257","article_type":"original","publisher":"American Physical Society","quality_controlled":"1","ec_funded":1,"abstract":[{"text":"Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local minima cannot be escaped by mild perturbations of the network. Motivated by these anomalies, we introduce best-edge dynamics (BED), a new plausible stochastic process. We prove that BED always reaches balance and that it does so fast in various interesting settings.","lang":"eng"}],"day":"29","doi":"10.1103/physreve.106.034321","arxiv":1,"external_id":{"arxiv":["2210.02394"],"isi":["000870243100001"]},"isi":1,"year":"2022","citation":{"mla":"Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” <i>Physical Review E</i>, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/physreve.106.034321\">10.1103/physreve.106.034321</a>.","short":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical Review E 106 (2022).","ista":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. 2022. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 106(3), 034321.","ama":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. Social balance on networks: Local minima and best-edge dynamics. <i>Physical Review E</i>. 2022;106(3). doi:<a href=\"https://doi.org/10.1103/physreve.106.034321\">10.1103/physreve.106.034321</a>","apa":"Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., &#38; Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physreve.106.034321\">https://doi.org/10.1103/physreve.106.034321</a>","ieee":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” <i>Physical Review E</i>, vol. 106, no. 3. American Physical Society, 2022.","chicago":"Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” <i>Physical Review E</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/physreve.106.034321\">https://doi.org/10.1103/physreve.106.034321</a>."},"date_updated":"2025-07-14T09:09:49Z","volume":106,"acknowledgement":"K.C. acknowledges support from ERC Start Grant No. (279307: Graph Games), ERC Consolidator Grant No. (863818: ForM-SMart), and Austrian Science Fund (FWF)\r\nGrants No. P23499-N23 and No. S11407-N23 (RiSE). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385.","article_number":"034321","month":"09","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"oa_version":"Preprint","publication":"Physical Review E","language":[{"iso":"eng"}],"oa":1,"publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]},"type":"journal_article","date_published":"2022-09-29T00:00:00Z","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.02394"}]},{"language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","Cellular and Molecular Neuroscience","Genetics","Molecular Biology","Ecology","Modeling and Simulation","Ecology","Evolution","Behavior and Systematics"],"month":"06","article_number":"e1010149","oa_version":"Published Version","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication":"PLOS Computational Biology","has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","file":[{"success":1,"access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"12460","checksum":"31b6b311b6731f1658277a9dfff6632c","file_size":3143222,"date_created":"2023-01-30T11:28:13Z","file_name":"2022_PlosCompBio_Schmid.pdf","content_type":"application/pdf","date_updated":"2023-01-30T11:28:13Z"}],"oa":1,"publication_identifier":{"eissn":["1553-7358"]},"date_published":"2022-06-14T00:00:00Z","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_type":"original","publisher":"Public Library of Science","file_date_updated":"2023-01-30T11:28:13Z","quality_controlled":"1","ec_funded":1,"title":"Direct reciprocity between individuals that use different strategy spaces","intvolume":"        18","publication_status":"published","date_created":"2023-01-16T10:02:51Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"author":[{"last_name":"Schmid","first_name":"Laura","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87"},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"issue":"6","pmid":1,"_id":"12280","scopus_import":"1","ddc":["000","570"],"acknowledgement":"This work was supported by the European Research Council (https://erc.europa.eu/)\r\nCoG 863818 (ForM-SMArt) (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","volume":18,"abstract":[{"text":"In repeated interactions, players can use strategies that respond to the outcome of previous rounds. Much of the existing literature on direct reciprocity assumes that all competing individuals use the same strategy space. Here, we study both learning and evolutionary dynamics of players that differ in the strategy space they explore. We focus on the infinitely repeated donation game and compare three natural strategy spaces: memory-1 strategies, which consider the last moves of both players, reactive strategies, which respond to the last move of the co-player, and unconditional strategies. These three strategy spaces differ in the memory capacity that is needed. We compute the long term average payoff that is achieved in a pairwise learning process. We find that smaller strategy spaces can dominate larger ones. For weak selection, unconditional players dominate both reactive and memory-1 players. For intermediate selection, reactive players dominate memory-1 players. Only for strong selection and low cost-to-benefit ratio, memory-1 players dominate the others. We observe that the supergame between strategy spaces can be a social dilemma: maximum payoff is achieved if both players explore a larger strategy space, but smaller strategy spaces dominate.","lang":"eng"}],"doi":"10.1371/journal.pcbi.1010149","day":"14","isi":1,"external_id":{"pmid":["35700167"],"isi":["000843626800031"]},"date_updated":"2025-07-14T09:09:49Z","year":"2022","citation":{"ieee":"L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” <i>PLOS Computational Biology</i>, vol. 18, no. 6. Public Library of Science, 2022.","chicago":"Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” <i>PLOS Computational Biology</i>. Public Library of Science, 2022. <a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">https://doi.org/10.1371/journal.pcbi.1010149</a>.","apa":"Schmid, L., Hilbe, C., Chatterjee, K., &#38; Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">https://doi.org/10.1371/journal.pcbi.1010149</a>","ama":"Schmid L, Hilbe C, Chatterjee K, Nowak M. Direct reciprocity between individuals that use different strategy spaces. <i>PLOS Computational Biology</i>. 2022;18(6). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">10.1371/journal.pcbi.1010149</a>","ista":"Schmid L, Hilbe C, Chatterjee K, Nowak M. 2022. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 18(6), e1010149.","mla":"Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” <i>PLOS Computational Biology</i>, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">10.1371/journal.pcbi.1010149</a>.","short":"L. Schmid, C. Hilbe, K. Chatterjee, M. Nowak, PLOS Computational Biology 18 (2022)."}},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2112.09495"}],"date_published":"2022-06-28T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"isbn":["9781577358350"],"issn":["2159-5399"],"eissn":["2374-3468"]},"language":[{"iso":"eng"}],"keyword":["General Medicine"],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","month":"06","oa_version":"Preprint","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"volume":36,"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\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385.","external_id":{"arxiv":["2112.09495"]},"date_updated":"2025-07-14T09:09:58Z","year":"2022","citation":{"mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., &#38; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(7):7326-7336. doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>."},"abstract":[{"text":"We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. \r\n In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present a method for learning neural network RSMs. \r\n We prove that our approach guarantees a.s. asymptotic stability of the system and\r\n provides the first method to obtain bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n Finally, we validate our approach experimentally on a set of nonlinear stochastic reinforcement learning environments with neural network policies.","lang":"eng"}],"doi":"10.1609/aaai.v36i7.20695","arxiv":1,"day":"28","page":"7326-7336","quality_controlled":"1","ec_funded":1,"article_type":"original","publisher":"Association for the Advancement of Artificial Intelligence","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}],"issue":"7","_id":"12511","scopus_import":"1","title":"Stability verification in stochastic control systems via neural network supermartingales","intvolume":"        36","publication_status":"published","date_created":"2023-02-05T17:29:50Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_processing_charge":"No"},{"abstract":[{"text":"We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered for SSP, which however is oblivious to the incurred risk. We present an alternative view, instead optimizing conditional value-at-risk (CVaR), an established risk measure. We treat both Markov chains as well as MDP and introduce, through novel insights, two algorithms, based on linear programming and value iteration, respectively. Both algorithms offer precise and provably correct solutions. Evaluation of our prototype implementation shows that risk-aware control is feasible on several moderately sized models.","lang":"eng"}],"day":"28","arxiv":1,"doi":"10.1609/aaai.v36i9.21222","external_id":{"arxiv":["2203.01640"]},"citation":{"ista":"Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867.","mla":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:<a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">10.1609/aaai.v36i9.21222</a>.","short":"T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.","ieee":"T. Meggendorfer, “Risk-aware stochastic shortest path,” in <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.","chicago":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, 36:9858–67. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">https://doi.org/10.1609/aaai.v36i9.21222</a>.","apa":"Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i> (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">https://doi.org/10.1609/aaai.v36i9.21222</a>","ama":"Meggendorfer T. Risk-aware stochastic shortest path. In: <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:<a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">10.1609/aaai.v36i9.21222</a>"},"year":"2022","date_updated":"2023-02-20T07:19:12Z","volume":36,"intvolume":"        36","title":"Risk-aware stochastic shortest path","department":[{"_id":"KrCh"}],"date_created":"2023-02-19T23:00:56Z","article_processing_charge":"No","publication_status":"published","issue":"9","author":[{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"scopus_import":"1","_id":"12568","publisher":"Association for the Advancement of Artificial Intelligence","quality_controlled":"1","page":"9858-9867","oa":1,"publication_identifier":{"eissn":["2374-3468"],"isbn":["1577358767"]},"type":"conference","date_published":"2022-06-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2203.01640"}],"month":"06","oa_version":"Preprint","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022","conference":{"start_date":"2022-02-22","name":"Conference on Artificial Intelligence","end_date":"2022-03-01","location":"Virtual"},"language":[{"iso":"eng"}]},{"date_published":"2022-09-28T00:00:00Z","external_id":{"arxiv":["2209.14368"]},"type":"preprint","date_updated":"2025-07-14T09:09:51Z","year":"2022","citation":{"mla":"Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, 2209.14368, doi:<a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">10.48550/ARXIV.2209.14368</a>.","short":"K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).","ista":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368.","apa":"Chatterjee, K., Mohammadi, M., &#38; Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">https://doi.org/10.48550/ARXIV.2209.14368</a>","ama":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">10.48550/ARXIV.2209.14368</a>","chicago":"Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">https://doi.org/10.48550/ARXIV.2209.14368</a>.","ieee":"K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” <i>arXiv</i>. ."},"abstract":[{"lang":"eng","text":"In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal."}],"oa":1,"doi":"10.48550/ARXIV.2209.14368","arxiv":1,"day":"28","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2209.14368"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mona","last_name":"Mohammadi","full_name":"Mohammadi, Mona","id":"4363614d-b686-11ed-a7d5-ac9e4a24bc2e"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","first_name":"Raimundo J"}],"_id":"12677","publication":"arXiv","month":"09","title":"Repeated prophet inequality with near-optimal bounds","article_number":"2209.14368","publication_status":"submitted","oa_version":"Preprint","date_created":"2023-02-24T12:21:40Z","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"ec_funded":1},{"oa_version":"Published Version","month":"09","article_number":"11","publication":"33rd International Conference on Concurrency Theory ","has_accepted_license":"1","conference":{"location":"Warsaw, Poland","end_date":"2022-09-16","name":"CONCUR: Conference on Concurrency Theory","start_date":"2022-09-13"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-09-15T00:00:00Z","type":"conference","file":[{"success":1,"relation":"main_file","access_level":"open_access","creator":"dernst","file_id":"14372","checksum":"e282e43d3ae0ba6e067b72f4583e13c0","file_size":960036,"date_created":"2023-09-26T10:43:15Z","file_name":"2022_LIPIcS_Grover.pdf","content_type":"application/pdf","date_updated":"2023-09-26T10:43:15Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","article_processing_charge":"No","date_created":"2023-03-28T08:09:32Z","department":[{"_id":"KrCh"}],"title":"Anytime guarantees for reachability in uncountable Markov decision processes","alternative_title":["LIPIcs"],"intvolume":"       243","_id":"12775","scopus_import":"1","author":[{"full_name":"Grover, Kush","first_name":"Kush","last_name":"Grover"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"last_name":"Weininger","first_name":"Maimilian","full_name":"Weininger, Maimilian"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","file_date_updated":"2023-09-26T10:43:15Z","doi":"10.4230/LIPIcs.CONCUR.2022.11","arxiv":1,"day":"15","abstract":[{"lang":"eng","text":"We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a sequence of approximations converging to the true value in the limit, our aim is to obtain an algorithm with guarantees on the precision of the approximation.\r\nAs this problem is undecidable in general, assumptions on the MDP are necessary. Our main contribution is to identify sufficient assumptions that are as weak as possible, thus approaching the \"boundary\" of which systems can be correctly and reliably analyzed. To this end, we also argue why each of our assumptions is necessary for algorithms based on processing finitely many observations.\r\nWe present two solution variants. The first one provides converging lower bounds under weaker assumptions than typical ones from previous works concerned with guarantees. The second one then utilizes stronger assumptions to additionally provide converging upper bounds. Altogether, we obtain an anytime algorithm, i.e. yielding a sequence of approximants with known and iteratively improving precision, converging to the true value in the limit. Besides, due to the generality of our assumptions, our algorithms are very general templates, readily allowing for various heuristics from literature in contrast to, e.g., a specific discretization algorithm. Our theoretical contribution thus paves the way for future practical improvements without sacrificing correctness guarantees."}],"date_updated":"2023-09-26T10:43:30Z","year":"2022","citation":{"mla":"Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” <i>33rd International Conference on Concurrency Theory </i>, vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">10.4230/LIPIcs.CONCUR.2022.11</a>.","short":"K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ista":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. 2022. Anytime guarantees for reachability in uncountable Markov decision processes. 33rd International Conference on Concurrency Theory . CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 11.","apa":"Grover, K., Kretinsky, J., Meggendorfer, T., &#38; Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In <i>33rd International Conference on Concurrency Theory </i> (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.11</a>","ama":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: <i>33rd International Conference on Concurrency Theory </i>. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">10.4230/LIPIcs.CONCUR.2022.11</a>","chicago":"Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” In <i>33rd International Conference on Concurrency Theory </i>, Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.11</a>.","ieee":"K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in <i>33rd International Conference on Concurrency Theory </i>, Warsaw, Poland, 2022, vol. 243."},"external_id":{"arxiv":["2008.04824"]},"volume":243,"acknowledgement":"Kush Grover: The author has been supported by the DFG research training group GRK\r\n2428 ConVeY.\r\nMaximilian Weininger: The author has been partially supported by DFG projects 383882557\r\nStatistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic\r\nVerification (GOPro)","ddc":["000"]},{"publication":"35th Conference on Neural Information Processing Systems","has_accepted_license":"1","month":"12","oa_version":"Published Version","project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2021-12-10","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06"},"date_published":"2021-12-01T00:00:00Z","type":"conference","tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"oa":1,"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"status":"public","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2022-01-26T07:39:59Z","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_size":452492,"date_updated":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","content_type":"application/pdf","relation":"main_file","success":1,"access_level":"open_access","file_id":"10682","creator":"mlechner"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Žikelić","first_name":"Ðorđe","full_name":"Žikelić, Ðorđe"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"_id":"10667","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","alternative_title":[" Advances in Neural Information Processing Systems"],"title":"Infinite time horizon safety of Bayesian neural networks","publication_status":"published","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2022-01-25T15:45:58Z","file_date_updated":"2022-01-26T07:39:59Z","ec_funded":1,"quality_controlled":"1","external_id":{"arxiv":["2111.03165"]},"date_updated":"2025-07-14T09:10:12Z","year":"2021","citation":{"apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, ."},"abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"arxiv":1,"doi":"10.48550/arXiv.2111.03165","day":"01","ddc":["000"],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), 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."},{"language":[{"iso":"eng"}],"conference":{"location":"Virtual","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10"},"publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","month":"01","oa_version":"Preprint","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"date_published":"2021-01-01T00:00:00Z","type":"conference","oa":1,"publication_identifier":{"isbn":["978-1-61197-646-5"]},"page":"617-636","ec_funded":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}],"author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"_id":"10694","scopus_import":"1","title":"Infinite-duration all-pay bidding games","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2022-01-27T12:11:23Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","external_id":{"arxiv":["2005.06636"]},"date_updated":"2025-07-14T09:10:12Z","year":"2021","citation":{"chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>."},"abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph 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, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"arxiv":1,"doi":"10.1137/1.9781611976465.38","day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"type":"conference","date_published":"2021-09-01T00:00:00Z","oa":1,"publication_identifier":{"issn":["1045-0823"],"isbn":["9780999241196"]},"language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization","start_date":"2021-08-19","location":"Virtual, Online","end_date":"2021-08-27"},"publication":"30th International Joint Conference on Artificial Intelligence","month":"09","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"oa_version":"Published Version","acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. ","citation":{"ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in <i>30th International Joint Conference on Artificial Intelligence</i>, Virtual, Online, 2021, pp. 4182–4189.","chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In <i>30th International Joint Conference on Artificial Intelligence</i>, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., &#38; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In <i>30th International Joint Conference on Artificial Intelligence</i> (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: <i>30th International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>","ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” <i>30th International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>."},"year":"2021","date_updated":"2025-07-14T09:10:13Z","abstract":[{"lang":"eng","text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game."}],"day":"01","doi":"10.24963/ijcai.2021/575","ec_funded":1,"quality_controlled":"1","page":"4182-4189","publisher":"International Joint Conferences on Artificial Intelligence","author":[{"full_name":"Tomášek, Petr","first_name":"Petr","last_name":"Tomášek"},{"full_name":"Horák, Karel","first_name":"Karel","last_name":"Horák"},{"full_name":"Aradhye, Aditya","first_name":"Aditya","last_name":"Aradhye"},{"last_name":"Bošanský","first_name":"Branislav","full_name":"Bošanský, Branislav"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"}],"scopus_import":"1","_id":"10847","title":"Solving partially observable stochastic shortest-path games","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2022-03-13T23:01:47Z","publication_status":"published"},{"publication_identifier":{"issn":["0166218X"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"journal_article","date_published":"2021-01-31T00:00:00Z","file":[{"file_size":652739,"checksum":"f1039ff5a2d6ca116720efdb84ee9d5e","date_created":"2021-02-04T11:28:42Z","content_type":"application/pdf","file_name":"2021_DiscreteApplMath_Zeiner.pdf","date_updated":"2021-02-04T11:28:42Z","access_level":"open_access","success":1,"relation":"main_file","creator":"dernst","file_id":"9089"}],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","month":"01","has_accepted_license":"1","publication":"Discrete Applied Mathematics","language":[{"iso":"eng"}],"day":"31","doi":"10.1016/j.dam.2020.10.022","abstract":[{"text":"We study optimal election sequences for repeatedly selecting a (very) small group of leaders among a set of participants (players) with publicly known unique ids. In every time slot, every player has to select exactly one player that it considers to be the current leader, oblivious to the selection of the other players, but with the overarching goal of maximizing a given parameterized global (“social”) payoff function in the limit. We consider a quite generic model, where the local payoff achieved by a given player depends, weighted by some arbitrary but fixed real parameter, on the number of different leaders chosen in a round, the number of players that choose the given player as the leader, and whether the chosen leader has changed w.r.t. the previous round or not. The social payoff can be the maximum, average or minimum local payoff of the players. Possible applications include quite diverse examples such as rotating coordinator-based distributed algorithms and long-haul formation flying of social birds. Depending on the weights and the particular social payoff, optimal sequences can be very different, from simple round-robin where all players chose the same leader alternatingly every time slot to very exotic patterns, where a small group of leaders (at most 2) is elected in every time slot. Moreover, we study the question if and when a single player would not benefit w.r.t. its local payoff when deviating from the given optimal sequence, i.e., when our optimal sequences are Nash equilibria in the restricted strategy space of oblivious strategies. As this is the case for many parameterizations of our model, our results reveal that no punishment is needed to make it rational for the players to optimize the social payoff.","lang":"eng"}],"year":"2021","citation":{"short":"M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.","mla":"Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” <i>Discrete Applied Mathematics</i>, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:<a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">10.1016/j.dam.2020.10.022</a>.","ista":"Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 289(1), 392–415.","apa":"Zeiner, M., Schmid, U., &#38; Chatterjee, K. (2021). Optimal strategies for selecting coordinators. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">https://doi.org/10.1016/j.dam.2020.10.022</a>","ama":"Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators. <i>Discrete Applied Mathematics</i>. 2021;289(1):392-415. doi:<a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">10.1016/j.dam.2020.10.022</a>","chicago":"Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.” <i>Discrete Applied Mathematics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">https://doi.org/10.1016/j.dam.2020.10.022</a>.","ieee":"M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” <i>Discrete Applied Mathematics</i>, vol. 289, no. 1. Elsevier, pp. 392–415, 2021."},"date_updated":"2023-08-04T11:12:41Z","external_id":{"isi":["000596823800035"]},"isi":1,"acknowledgement":"We are grateful to Matthias Függer and Thomas Nowak for having raised our interest in the problem studied in this paper.\r\nThis work has been supported the Austrian Science Fund (FWF) projects S11405, S11407 (RiSE), and P28182 (ADynNet).","volume":289,"ddc":["510"],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2020-11-22T23:01:26Z","publication_status":"published","intvolume":"       289","title":"Optimal strategies for selecting coordinators","scopus_import":"1","_id":"8793","issue":"1","author":[{"full_name":"Zeiner, Martin","last_name":"Zeiner","first_name":"Martin"},{"full_name":"Schmid, Ulrich","first_name":"Ulrich","last_name":"Schmid"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"publisher":"Elsevier","article_type":"original","quality_controlled":"1","page":"392-415","file_date_updated":"2021-02-04T11:28:42Z"},{"author":[{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","last_name":"Goharshady"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","_id":"8934","alternative_title":["ISTA Thesis"],"title":"Parameterized and algebro-geometric advances in static program analysis","date_created":"2020-12-10T12:17:07Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"article_processing_charge":"No","publication_status":"published","file_date_updated":"2021-12-23T23:30:04Z","page":"278","publisher":"Institute of Science and Technology Austria","citation":{"ama":"Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8934\">10.15479/AT:ISTA:8934</a>","apa":"Goharshady, A. K. (2021). <i>Parameterized and algebro-geometric advances in static program analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8934\">https://doi.org/10.15479/AT:ISTA:8934</a>","ieee":"A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.","chicago":"Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:8934\">https://doi.org/10.15479/AT:ISTA:8934</a>.","mla":"Goharshady, Amir Kafshdar. <i>Parameterized and Algebro-Geometric Advances in Static Program Analysis</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8934\">10.15479/AT:ISTA:8934</a>.","short":"A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021.","ista":"Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria."},"year":"2021","date_updated":"2025-06-02T08:53:47Z","abstract":[{"text":"In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.\r\nWe use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades.","lang":"eng"}],"day":"01","doi":"10.15479/AT:ISTA:8934","degree_awarded":"PhD","ddc":["005"],"acknowledgement":"The research was partially supported by an IBM PhD fellowship, a Facebook PhD fellowship, and DOC fellowship #24956 of the Austrian Academy of Sciences (OeAW).","has_accepted_license":"1","month":"01","project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"type":"dissertation","date_published":"2021-01-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"oa":1,"supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"publication_identifier":{"issn":["2663-337X"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","related_material":{"record":[{"id":"1386","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"1437"},{"status":"public","relation":"part_of_dissertation","id":"639"},{"status":"public","id":"6918","relation":"part_of_dissertation"},{"status":"public","id":"6490","relation":"part_of_dissertation"},{"id":"7158","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"6009"},{"status":"public","id":"949","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"311","status":"public"},{"id":"7810","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"8089","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8728"},{"status":"public","relation":"part_of_dissertation","id":"5977"},{"status":"public","relation":"part_of_dissertation","id":"6056"},{"id":"6175","relation":"part_of_dissertation","status":"public"},{"id":"6340","relation":"part_of_dissertation","status":"public"},{"id":"6378","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"6380","status":"public"},{"id":"66","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"6780"},{"status":"public","id":"7014","relation":"part_of_dissertation"}]},"file":[{"file_id":"8969","creator":"akafshda","relation":"main_file","access_level":"open_access","date_updated":"2021-12-23T23:30:04Z","content_type":"application/pdf","file_name":"Thesis-pdfa.pdf","date_created":"2020-12-22T20:08:44Z","embargo":"2021-12-22","checksum":"d1b9db3725aed34dadd81274aeb9426c","file_size":5251507},{"file_id":"8970","creator":"akafshda","relation":"source_file","access_level":"closed","date_updated":"2021-03-04T23:30:04Z","file_name":"source.zip","content_type":"application/zip","date_created":"2020-12-22T20:08:50Z","checksum":"1661df7b393e6866d2460eba3c905130","file_size":10636756,"embargo_to":"open_access"}]},{"publisher":"Elsevier","article_type":"original","quality_controlled":"1","date_created":"2021-03-28T22:01:40Z","department":[{"_id":"KrCh"}],"article_processing_charge":"No","publication_status":"published","intvolume":"       297","title":"Algorithms and conditional lower bounds for planning problems","scopus_import":"1","_id":"9293","issue":"8","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dvořák, Wolfgang","last_name":"Dvořák","first_name":"Wolfgang"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Svozil","first_name":"Alexander","full_name":"Svozil, Alexander"}],"volume":297,"day":"16","doi":"10.1016/j.artint.2021.103499","arxiv":1,"abstract":[{"text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.","lang":"eng"}],"year":"2021","citation":{"ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. 2021;297(8). doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., &#38; Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” <i>Artificial Intelligence</i>, vol. 297, no. 8. Elsevier, 2021.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>, vol. 297, no. 8, 103499, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>.","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499."},"date_updated":"2023-09-26T10:41:42Z","external_id":{"arxiv":["1804.07031"],"isi":["000657537500003"]},"isi":1,"language":[{"iso":"eng"}],"oa_version":"Preprint","article_number":"103499","month":"03","publication":"Artificial Intelligence","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"35","relation":"earlier_version"}]},"status":"public","publication_identifier":{"issn":["0004-3702"]},"oa":1,"type":"journal_article","date_published":"2021-03-16T00:00:00Z"},{"date_published":"2021-02-16T00:00:00Z","type":"conference","oa":1,"publication_identifier":{"eissn":["16113349"],"issn":["03029743"],"isbn":["9783030682101"]},"status":"public","related_material":{"record":[{"id":"11938","relation":"later_version","status":"public"}]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","main_file_link":[{"url":"https://arxiv.org/abs/2101.03928","open_access":"1"}],"publication":"15th International Conference on Algorithms and Computation","month":"02","oa_version":"Preprint","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"The Wittgenstein Prize","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"conference":{"name":"WALCOM: Algorithms and Computation","start_date":"2021-02-28","end_date":"2021-03-02","location":"Yangon, Myanmar"},"external_id":{"arxiv":["2101.03928"]},"date_updated":"2023-02-21T16:33:44Z","citation":{"ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” <i>15th International Conference on Algorithms and Computation</i>, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">10.1007/978-3-030-68211-8_18</a>.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” In <i>15th International Conference on Algorithms and Computation</i>, 12635:221–33. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">https://doi.org/10.1007/978-3-030-68211-8_18</a>.","ieee":"O. Aichholzer <i>et al.</i>, “On compatible matchings,” in <i>15th International Conference on Algorithms and Computation</i>, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: <i>15th International Conference on Algorithms and Computation</i>. Vol 12635. Springer Nature; 2021:221-233. doi:<a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">10.1007/978-3-030-68211-8_18</a>","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In <i>15th International Conference on Algorithms and Computation</i> (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">https://doi.org/10.1007/978-3-030-68211-8_18</a>"},"year":"2021","abstract":[{"lang":"eng","text":" matching is compatible to two or more labeled point sets of size n with labels   {1,…,n}  if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled convex sets of n points there exists a compatible matching with   ⌊2n−−√⌋  edges. More generally, for any   ℓ  labeled point sets we construct compatible matchings of size   Ω(n1/ℓ) . As a corresponding upper bound, we use probabilistic arguments to show that for any   ℓ  given sets of n points there exists a labeling of each set such that the largest compatible matching has   O(n2/(ℓ+1))  edges. Finally, we show that   Θ(logn)  copies of any set of n points are necessary and sufficient for the existence of a labeling such that any compatible matching consists only of a single edge."}],"arxiv":1,"doi":"10.1007/978-3-030-68211-8_18","day":"16","acknowledgement":"A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","volume":12635,"author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"first_name":"Alan M","last_name":"Arroyo Guevara","orcid":"0000-0003-2401-8670","full_name":"Arroyo Guevara, Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zuzana","last_name":"Masárová","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Irene","last_name":"Parada","full_name":"Parada, Irene"},{"first_name":"Daniel","last_name":"Perz","full_name":"Perz, Daniel"},{"full_name":"Pilz, Alexander","first_name":"Alexander","last_name":"Pilz"},{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}],"_id":"9296","scopus_import":"1","alternative_title":["LNCS"],"title":"On compatible matchings","intvolume":"     12635","publication_status":"published","date_created":"2021-03-28T22:01:41Z","article_processing_charge":"No","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"page":"221-233","quality_controlled":"1","ec_funded":1,"publisher":"Springer Nature"},{"ddc":["000"],"acknowledgement":"Authors would like to thank Christian Hilbe and Martin Nowak for their inspiring and very helpful feedback on the manuscript.","volume":17,"external_id":{"isi":["000639711200001"]},"isi":1,"year":"2021","citation":{"short":"M. Kleshnina, S.S. Streipert, J.A. Filar, K. Chatterjee, PLoS Computational Biology 17 (2021).","mla":"Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” <i>PLoS Computational Biology</i>, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1008523\">10.1371/journal.pcbi.1008523</a>.","ista":"Kleshnina M, Streipert SS, Filar JA, Chatterjee K. 2021. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 17(4), e1008523.","ama":"Kleshnina M, Streipert SS, Filar JA, Chatterjee K. Mistakes can stabilise the dynamics of rock-paper-scissors games. <i>PLoS Computational Biology</i>. 2021;17(4). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1008523\">10.1371/journal.pcbi.1008523</a>","apa":"Kleshnina, M., Streipert, S. S., Filar, J. A., &#38; Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1008523\">https://doi.org/10.1371/journal.pcbi.1008523</a>","ieee":"M. Kleshnina, S. S. Streipert, J. A. Filar, and K. Chatterjee, “Mistakes can stabilise the dynamics of rock-paper-scissors games,” <i>PLoS Computational Biology</i>, vol. 17, no. 4. Public Library of Science, 2021.","chicago":"Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” <i>PLoS Computational Biology</i>. Public Library of Science, 2021. <a href=\"https://doi.org/10.1371/journal.pcbi.1008523\">https://doi.org/10.1371/journal.pcbi.1008523</a>."},"date_updated":"2025-07-14T09:10:04Z","abstract":[{"lang":"eng","text":"A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium."}],"day":"01","doi":"10.1371/journal.pcbi.1008523","file_date_updated":"2021-05-11T13:50:06Z","ec_funded":1,"quality_controlled":"1","article_type":"original","publisher":"Public Library of Science","issue":"4","author":[{"full_name":"Kleshnina, Maria","last_name":"Kleshnina","first_name":"Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Streipert, Sabrina S.","first_name":"Sabrina S.","last_name":"Streipert"},{"last_name":"Filar","first_name":"Jerzy A.","full_name":"Filar, Jerzy A."},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"}],"scopus_import":"1","_id":"9381","intvolume":"        17","title":"Mistakes can stabilise the dynamics of rock-paper-scissors games","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2021-05-09T22:01:38Z","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","file":[{"checksum":"a94ebe0c4116f5047eaa6029e54d2dac","file_size":1323820,"date_created":"2021-05-11T13:50:06Z","file_name":"2021_pcbi_Kleshnina.pdf","content_type":"application/pdf","date_updated":"2021-05-11T13:50:06Z","access_level":"open_access","success":1,"relation":"main_file","creator":"kschuh","file_id":"9385"}],"type":"journal_article","date_published":"2021-04-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"publication_identifier":{"issn":["1553734X"],"eissn":["15537358"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"PLoS Computational Biology","article_number":"e1008523","month":"04","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"oa_version":"Published Version"},{"volume":57,"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.","day":"01","doi":"10.1007/s10703-021-00373-5","arxiv":1,"abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.","lang":"eng"}],"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” <i>Formal Methods in System Design</i>, vol. 57, Springer, 2021, pp. 401–28, doi:<a href=\"https://doi.org/10.1007/s10703-021-00373-5\">10.1007/s10703-021-00373-5</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-021-00373-5\">https://doi.org/10.1007/s10703-021-00373-5</a>","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. <i>Formal Methods in System Design</i>. 2021;57:401-428. doi:<a href=\"https://doi.org/10.1007/s10703-021-00373-5\">10.1007/s10703-021-00373-5</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” <i>Formal Methods in System Design</i>, vol. 57. Springer, pp. 401–428, 2021.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” <i>Formal Methods in System Design</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s10703-021-00373-5\">https://doi.org/10.1007/s10703-021-00373-5</a>."},"year":"2021","date_updated":"2023-10-10T11:13:20Z","external_id":{"isi":["000645490300001"],"arxiv":["1504.07384"]},"isi":1,"publisher":"Springer","article_type":"original","ec_funded":1,"quality_controlled":"1","page":"401-428","date_created":"2021-05-16T22:01:47Z","department":[{"_id":"KrCh"}],"article_processing_charge":"No","publication_status":"published","intvolume":"        57","title":"Faster algorithms for quantitative verification in bounded treewidth graphs","scopus_import":"1","_id":"9393","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07384"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"eissn":["1572-8102"],"issn":["0925-9856"]},"oa":1,"type":"journal_article","date_published":"2021-09-01T00:00:00Z","language":[{"iso":"eng"}],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","month":"09","publication":"Formal Methods in System Design"},{"scopus_import":"1","_id":"9402","pmid":1,"issue":"10","author":[{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","full_name":"Schmid, Laura","first_name":"Laura","last_name":"Schmid"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"full_name":"Nowak, Martin A.","last_name":"Nowak","first_name":"Martin A."}],"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"article_processing_charge":"No","date_created":"2021-05-18T16:56:57Z","publication_status":"published","intvolume":"         5","title":"A unified framework of direct and indirect reciprocity","ec_funded":1,"quality_controlled":"1","page":"1292–1302","file_date_updated":"2023-11-07T08:27:23Z","publisher":"Springer Nature","article_type":"original","citation":{"chicago":"Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” <i>Nature Human Behaviour</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41562-021-01114-8\">https://doi.org/10.1038/s41562-021-01114-8</a>.","ieee":"L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” <i>Nature Human Behaviour</i>, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021.","ama":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and indirect reciprocity. <i>Nature Human Behaviour</i>. 2021;5(10):1292–1302. doi:<a href=\"https://doi.org/10.1038/s41562-021-01114-8\">10.1038/s41562-021-01114-8</a>","apa":"Schmid, L., Chatterjee, K., Hilbe, C., &#38; Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. <i>Nature Human Behaviour</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41562-021-01114-8\">https://doi.org/10.1038/s41562-021-01114-8</a>","ista":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.","mla":"Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.” <i>Nature Human Behaviour</i>, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:<a href=\"https://doi.org/10.1038/s41562-021-01114-8\">10.1038/s41562-021-01114-8</a>.","short":"L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302."},"year":"2021","date_updated":"2025-07-14T09:10:09Z","external_id":{"pmid":["33986519"],"isi":["000650304000002"]},"isi":1,"day":"13","doi":"10.1038/s41562-021-01114-8","abstract":[{"lang":"eng","text":"Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability."}],"volume":5,"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Start Grant 279307: Graph Games (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","ddc":["000"],"has_accepted_license":"1","publication":"Nature Human Behaviour","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","month":"05","language":[{"iso":"eng"}],"type":"journal_article","date_published":"2021-05-13T00:00:00Z","publication_identifier":{"eissn":["2397-3374"]},"oa":1,"file":[{"file_name":"2021_NatureHumanBehaviour_Schmid_accepted.pdf","content_type":"application/pdf","date_updated":"2023-11-07T08:27:23Z","checksum":"34f55e173f90dc1dab731063458ac780","file_size":5232761,"date_created":"2023-11-07T08:27:23Z","creator":"dernst","file_id":"14496","relation":"main_file","success":1,"access_level":"open_access"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/the-emergence-of-cooperation/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"id":"10293","relation":"dissertation_contains","status":"public"}]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"quality_controlled":"1","series_title":"Strüngmann Forum Reports","page":"139-152","editor":[{"first_name":"Ralph","last_name":"Hertwig","full_name":"Hertwig, Ralph"},{"full_name":"Engel, Christoph","last_name":"Engel","first_name":"Christoph"}],"publisher":"MIT Press","author":[{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","first_name":"Laura","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329"},{"first_name":"Christian","last_name":"Hilbe","full_name":"Hilbe, Christian"}],"publication":"Deliberate Ignorance: Choosing Not To Know","_id":"9403","intvolume":"        29","title":"The evolution of strategic ignorance in strategic interaction","month":"03","date_created":"2021-05-19T12:25:42Z","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"oa_version":"Published Version","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf"}],"volume":29,"type":"book_chapter","date_published":"2021-03-01T00:00:00Z","year":"2021","citation":{"ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.","short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in <i>Deliberate Ignorance: Choosing Not To Know</i>, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","apa":"Schmid, L., &#38; Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig &#38; C. Engel (Eds.), <i>Deliberate Ignorance: Choosing Not To Know</i> (Vol. 29, pp. 139–152). MIT Press.","ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. <i>Deliberate Ignorance: Choosing Not To Know</i>. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152."},"date_updated":"2023-02-23T13:57:04Z","oa":1,"abstract":[{"text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore.","lang":"eng"}],"publication_identifier":{"isbn":["978-0-262-04559-9"]},"day":"01"},{"external_id":{"pmid":["34188036"],"isi":["000671752100003"]},"isi":1,"citation":{"short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).","mla":"Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.” <i>Nature Communications</i>, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-24271-w\">10.1038/s41467-021-24271-w</a>.","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009.","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers of natural selection. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-24271-w\">10.1038/s41467-021-24271-w</a>","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &#38; Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-24271-w\">https://doi.org/10.1038/s41467-021-24271-w</a>","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-24271-w\">https://doi.org/10.1038/s41467-021-24271-w</a>.","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021."},"year":"2021","date_updated":"2025-07-14T09:10:05Z","abstract":[{"text":"Selection and random drift determine the probability that novel mutations fixate in a population. Population structure is known to affect the dynamics of the evolutionary process. Amplifiers of selection are population structures that increase the fixation probability of beneficial mutants compared to well-mixed populations. Over the past 15 years, extensive research has produced remarkable structures called strong amplifiers which guarantee that every beneficial mutation fixates with high probability. But strong amplification has come at the cost of considerably delaying the fixation event, which can slow down the overall rate of evolution. However, the precise relationship between fixation probability and time has remained elusive. Here we characterize the slowdown effect of strong amplification. First, we prove that all strong amplifiers must delay the fixation event at least to some extent. Second, we construct strong amplifiers that delay the fixation event only marginally as compared to the well-mixed populations. Our results thus establish a tight relationship between fixation probability and time: Strong amplification always comes at a cost of a slowdown, but more than a marginal slowdown is not needed.","lang":"eng"}],"day":"29","doi":"10.1038/s41467-021-24271-w","ddc":["510"],"volume":12,"acknowledgement":"K.C. acknowledges support from ERC Start grant no. (279307: Graph Games), ERC Consolidator grant no. (863818: ForM-SMart), Austrian Science Fund (FWF) grant no. P23499-N23 and S11407-N23 (RiSE). M.A.N. acknowledges support from Office of Naval Research grant N00014-16-1-2914 and from the John Templeton Foundation.","issue":"1","author":[{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Nowak, Martin A.","last_name":"Nowak","first_name":"Martin A."}],"scopus_import":"1","_id":"9640","pmid":1,"intvolume":"        12","title":"Fast and strong amplifiers of natural selection","date_created":"2021-07-11T22:01:15Z","department":[{"_id":"KrCh"}],"article_processing_charge":"No","publication_status":"published","file_date_updated":"2021-07-19T13:02:20Z","ec_funded":1,"quality_controlled":"1","article_type":"original","publisher":"Springer Nature","type":"journal_article","date_published":"2021-06-29T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"publication_identifier":{"eissn":["20411723"]},"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"date_updated":"2021-07-19T13:02:20Z","file_name":"2021_NatCoom_Tkadlec.pdf","content_type":"application/pdf","date_created":"2021-07-19T13:02:20Z","file_size":628992,"checksum":"5767418926a7f7fb76151de29473dae0","file_id":"9692","creator":"cziletti","access_level":"open_access","success":1,"relation":"main_file"}],"has_accepted_license":"1","publication":"Nature Communications","article_number":"4009","month":"06","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"Published Version","language":[{"iso":"eng"}]}]