[{"oa_version":"None","contributor":[{"last_name":"Meggendorfer","contributor_type":"contact_person","first_name":"Tobias"}],"OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.10457565","open_access":"1"}],"day":"05","month":"03","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":" Žikelić","full_name":" Žikelić, Đorđe","first_name":"Đorđe"}],"OA_type":"green","abstract":[{"lang":"eng","text":"The artefact for the OOPSLA 2024 paper \"Quantitative Bounds on Resource Usage of Probabilistic Programs\".\r\n\r\n"}],"doi":"10.5281/zenodo.10457565","citation":{"apa":" Žikelić, Đ. (2024). Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. Zenodo. https://doi.org/10.5281/zenodo.10457565","mla":" Žikelić, Đorđe. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. Zenodo, 2024, doi:10.5281/zenodo.10457565.","ista":" Žikelić Đ. 2024. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs, Zenodo, 10.5281/zenodo.10457565.","ieee":"Đ. Žikelić, “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs.” Zenodo, 2024.","ama":" Žikelić Đ. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. 2024. doi:10.5281/zenodo.10457565","chicago":" Žikelić, Đorđe. “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs.” Zenodo, 2024. https://doi.org/10.5281/zenodo.10457565.","short":"Đ. Žikelić, (2024)."},"article_processing_charge":"No","fulldoi":"https://doi.org/10.5281/zenodo.10457565","department":[{"_id":"KrCh"}],"type":"research_data_reference","year":"2024","date_updated":"2026-10-15T10:02:33Z","status":"public","ddc":["000"],"_id":"23140","related_material":{"record":[{"relation":"used_in_publication","id":"17162","status":"public"}]},"publisher":"Zenodo","date_published":"2024-03-05T00:00:00Z","title":"Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs","oa":1,"date_created":"2026-10-15T10:02:22Z"},{"scopus_import":"1","month":"03","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","article_number":"e2315558121","dataavailabilitystatement":"Figures are based on simulation averages over many independent runs of the respective simulation. Results were analyzed and visualized with Python and Matlab R2023a. The computer code is published in (65). All other data are included in the manuscript and/or SI Appendix.","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"corr_author":"1","doi":"10.1073/pnas.2315558121","file_date_updated":"2024-03-12T13:12:22Z","citation":{"ieee":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, and M. Kleshnina, “Efficiency and resilience of cooperation in asymmetric social dilemmas,” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 10. National Academy of Sciences, 2024.","ista":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. 2024. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. 121(10), e2315558121.","short":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, M. Kleshnina, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","chicago":"Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2315558121.","ama":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(10). doi:10.1073/pnas.2315558121","mla":"Hübner, Valentin, et al. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 10, e2315558121, National Academy of Sciences, 2024, doi:10.1073/pnas.2315558121.","apa":"Hübner, V., Staab, M., Hilbe, C., Chatterjee, K., & Kleshnina, M. (2024). Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2315558121"},"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"abstract":[{"text":"Direct reciprocity is a powerful mechanism for cooperation in social dilemmas. The very logic of reciprocity, however, seems to require that individuals are symmetric, and that everyone has the same means to influence each others’ payoffs. Yet in many applications, individuals are asymmetric. Herein, we study the effect of asymmetry in linear public good games. Individuals may differ in their endowments (their ability to contribute to a public good) and in their productivities (how effective their contributions are). Given the individuals’ productivities, we ask which allocation of endowments is optimal for cooperation. To this end, we consider two notions of optimality. The first notion focuses on the resilience of cooperation. The respective endowment distribution ensures that full cooperation is feasible even under the most adverse conditions. The second notion focuses on efficiency. The corresponding endowment distribution maximizes group welfare. Using analytical methods, we fully characterize these two endowment distributions. This analysis reveals that both optimality notions favor some endowment inequality: More productive players ought to get higher endowments. Yet the two notions disagree on how unequal endowments are supposed to be. A focus on resilience results in less inequality. With additional simulations, we show that the optimal endowment allocation needs to account for both the resilience and the efficiency of cooperation.","lang":"eng"}],"article_processing_charge":"Yes (in subscription journal)","title":"Efficiency and resilience of cooperation in asymmetric social dilemmas","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir Programme, ANR-17-EURE-0010) (to M.K.).","external_id":{"isi":["001207786500004"],"pmid":["38408249"]},"APC_amount":"3041,76 EUR","_id":"15083","publisher":"National Academy of Sciences","date_updated":"2026-10-15T10:10:26Z","ddc":["000"],"day":"05","author":[{"last_name":"Hübner","orcid":"0009-0001-5009-4987","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin","first_name":"Valentin"},{"last_name":"Staab","full_name":"Staab, Manuel","first_name":"Manuel"},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","last_name":"Hilbe","first_name":"Christian","full_name":"Hilbe, Christian"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kleshnina","full_name":"Kleshnina, Maria","first_name":"Maria"}],"isi":1,"das_tickbox":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"OA_place":"publisher","volume":121,"supplementarymaterial":"yes","quality_controlled":"1","file":[{"file_id":"15109","content_type":"application/pdf","success":1,"file_size":2203220,"creator":"dernst","access_level":"open_access","date_created":"2024-03-12T13:12:22Z","file_name":"2024_PNAS_Huebner.pdf","checksum":"068520e3efd4d008bb9177e8aedb7d22","relation":"main_file","date_updated":"2024-03-12T13:12:22Z"}],"article_type":"original","OA_type":"hybrid","pmid":1,"publication":"Proceedings of the National Academy of Sciences of the United States of America","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication_status":"published","fulldoi":"https://doi.org/10.1073/pnas.2315558121","oa":1,"date_published":"2024-03-05T00:00:00Z","date_created":"2024-03-05T09:18:49Z","issue":"10","type":"journal_article","related_material":{"link":[{"relation":"press_release","description":"News on ISTA Website","url":"https://ista.ac.at/en/news/what-math-tells-us-about-social-dilemmas/"}],"record":[{"id":"15108","status":"public","relation":"research_data"},{"id":"19903","status":"public","relation":"dissertation_contains"}]},"intvolume":" 121","year":"2024","status":"public","researchdata_availability":"yes"},{"OA_place":"publisher","ec_funded":1,"das_tickbox":"1","isi":1,"author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","orcid":"0000-0002-1419-3267","first_name":"Jakub","full_name":"Svoboda, Jakub"},{"full_name":"Joshi, Soham Shrikant","first_name":"Soham Shrikant","last_name":"Joshi","id":"f97aac0e-f57c-11ee-93d0-a5a82d8df168"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","first_name":"Josef"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"day":"29","OA_type":"gold","article_type":"original","file":[{"content_type":"application/pdf","file_id":"17450","success":1,"file_size":1425292,"creator":"dernst","date_created":"2024-08-20T10:52:28Z","access_level":"open_access","file_name":"2024_PloSComBio_Svoboda.pdf","relation":"main_file","date_updated":"2024-08-20T10:52:28Z","checksum":"a511cf369d9172beb123fe73f291b5cc"}],"quality_controlled":"1","supplementarymaterial":"yes","volume":20,"fulldoi":"https://doi.org/10.1371/journal.pcbi.1012008","arxiv":1,"publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"PLoS Computational Biology","researchdata_availability":"yes","status":"public","year":"2024","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20138"}]},"intvolume":" 20","type":"journal_article","issue":"3","date_created":"2024-04-07T22:00:55Z","date_published":"2024-03-29T00:00:00Z","oa":1,"oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"03","scopus_import":"1","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"dataavailabilitystatement":"Code for the figures and the computational experiments is available from the Figshare repository: https://figshare.com/s/4e08d78c892749f84201.","article_number":"e1012008","DOAJ_listed":"1","article_processing_charge":"Yes","publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]},"abstract":[{"text":"Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate. Amplifiers of selection are networks that increase the fixation probability of advantageous mutants, as compared to the unstructured fully-connected network. Whether or not a network is an amplifier depends on the choice of the random process that governs the evolutionary dynamics. Two popular choices are Moran process with Birth-death updating and Moran process with death-Birth updating. Interestingly, while some networks are amplifiers under Birth-death updating and other networks are amplifiers under death-Birth updating, so far no spatial structures have been found that function as an amplifier under both types of updating simultaneously. In this work, we identify networks that act as amplifiers of selection under both versions of the Moran process. The amplifiers are robust, modular, and increase fixation probability for any mutant fitness advantage in a range r ∈ (1, 1.2). To complement this positive result, we also prove that for certain quantities closely related to fixation probability, it is impossible to improve them simultaneously for both versions of the Moran process. Together, our results highlight how the two versions of the Moran process differ and what they have in common.","lang":"eng"}],"doi":"10.1371/journal.pcbi.1012008","file_date_updated":"2024-08-20T10:52:28Z","citation":{"apa":"Svoboda, J., Joshi, S. S., Tkadlec, J., & Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1012008","mla":"Svoboda, Jakub, et al. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology, vol. 20, no. 3, e1012008, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1012008.","ista":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. 2024. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 20(3), e1012008.","ieee":"J. Svoboda, S. S. Joshi, J. Tkadlec, and K. Chatterjee, “Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating,” PLoS Computational Biology, vol. 20, no. 3. Public Library of Science, 2024.","ama":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 2024;20(3). doi:10.1371/journal.pcbi.1012008","short":"J. Svoboda, S.S. Joshi, J. Tkadlec, K. Chatterjee, PLoS Computational Biology 20 (2024).","chicago":"Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1012008."},"corr_author":"1","department":[{"_id":"KrCh"}],"has_accepted_license":"1","ddc":["000"],"date_updated":"2026-10-15T12:28:11Z","publisher":"Public Library of Science","_id":"15297","external_id":{"isi":["001194482400002"],"arxiv":["2401.14914"]},"APC_amount":"3149,96 EUR","acknowledgement":"We thank Gavin Rees for helpful discussions. J.S., S.J., and K.C were supported by\r\nEuropean Research Council (ERC) CoG 863818 (ForM-SMArt). J.T was supported by Center for Foundations of Modern Computer Science (Charles University project UNCE/SCI/004) and by the project PRIMUS/24/SCI/012 from Charles University. ","title":"Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating"},{"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://10.5281/zenodo.10639167"}],"day":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","author":[{"first_name":"Valentin","full_name":"Hübner, Valentin","last_name":"Hübner","orcid":"0009-0001-5009-4987","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910"},{"first_name":"Maria","full_name":"Kleshnina, Maria","last_name":"Kleshnina"}],"type":"research_data_reference","ddc":["000"],"status":"public","year":"2024","date_updated":"2026-10-15T10:10:25Z","_id":"15108","publisher":"Zenodo","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"15083"}]},"date_published":"2024-02-09T00:00:00Z","title":"Computer code for \"Efficiency and resilience of cooperation in asymmetric social dilemmas\"","oa":1,"date_created":"2024-03-12T13:02:58Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"lang":"eng","text":"in the research article \"Efficiency and resilience of cooperation in asymmetric social dilemmas\" (by Valentin Hübner, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina).\r\n\r\nWe used different implementations for the case of two and three players, both described below."}],"citation":{"mla":"Hübner, Valentin, and Maria Kleshnina. Computer Code for “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Zenodo, 2024, doi:10.5281/ZENODO.10639167.","apa":"Hübner, V., & Kleshnina, M. (2024). Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” Zenodo. https://doi.org/10.5281/ZENODO.10639167","ieee":"V. Hübner and M. Kleshnina, “Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas.’” Zenodo, 2024.","ista":"Hübner V, Kleshnina M. 2024. Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas’, Zenodo, 10.5281/ZENODO.10639167.","short":"V. Hübner, M. Kleshnina, (2024).","chicago":"Hübner, Valentin, and Maria Kleshnina. “Computer Code for ‘Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.’” Zenodo, 2024. https://doi.org/10.5281/ZENODO.10639167.","ama":"Hübner V, Kleshnina M. Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” 2024. doi:10.5281/ZENODO.10639167"},"doi":"10.5281/ZENODO.10639167","article_processing_charge":"No","fulldoi":"https://doi.org/10.5281/ZENODO.10639167","department":[{"_id":"KrCh"}],"has_accepted_license":"1","corr_author":"1"},{"external_id":{"arxiv":["2403.05386"],"isi":["001336893300031"]},"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Hong Kong Research Grants Council ECS Project Number 26208122.","date_updated":"2026-10-16T07:29:39Z","ddc":["000"],"publisher":"Springer Nature","_id":"18155","title":"Sound and complete witnesses for template-based verification of LTL properties on polynomial programs","abstract":[{"lang":"eng","text":"We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refutation (finding bugs) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which every assignment and guard consists only of polynomial expressions. For this setting, we provide an efficient algorithm to automatically synthesize such LTL witnesses. Our synthesis procedure is both sound and semi-complete. Finally, we present experimental results demonstrating the effectiveness of our approach and that it can handle programs which were beyond the reach of previous state-of-the-art tools."}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031711619"]},"doi":"10.1007/978-3-031-71162-6_31","file_date_updated":"2024-10-01T09:56:54Z","citation":{"ama":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 14933. Springer Nature; 2024:600-619. doi:10.1007/978-3-031-71162-6_31","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Goharshady, Mehrdad Karrabi, and Dorde Zikelic. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14933:600–619. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-71162-6_31.","short":"K. Chatterjee, A.K. Goharshady, E. Goharshady, M. Karrabi, D. Zikelic, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2024, pp. 600–619.","ista":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. 2024. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). FM: Formal Methods, LNCS, vol. 14933, 600–619.","ieee":"K. Chatterjee, A. K. Goharshady, E. Goharshady, M. Karrabi, and D. Zikelic, “Sound and complete witnesses for template-based verification of LTL properties on polynomial programs,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Milan, Italy, 2024, vol. 14933, pp. 600–619.","apa":"Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., & Zikelic, D. (2024). Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14933, pp. 600–619). Milan, Italy: Springer Nature. https://doi.org/10.1007/978-3-031-71162-6_31","mla":"Chatterjee, Krishnendu, et al. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14933, Springer Nature, 2024, pp. 600–19, doi:10.1007/978-3-031-71162-6_31."},"article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"KrCh"}],"has_accepted_license":"1","alternative_title":["LNCS"],"corr_author":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"dataavailabilitystatement":"The implementations of the algorithms mentioned in the experiments section and the benchmarks are available at doi.org/10.5281/zenodo.12518217.","oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"month":"09","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"conference","researchdata_availability":"yes","year":"2024","status":"public","intvolume":" 14933","related_material":{"record":[{"status":"public","relation":"research_data","id":"22798"}]},"date_published":"2024-09-11T00:00:00Z","oa":1,"date_created":"2024-09-29T22:01:37Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","fulldoi":"https://doi.org/10.1007/978-3-031-71162-6_31","publication_status":"published","arxiv":1,"conference":{"end_date":"2024-09-13","name":"FM: Formal Methods","start_date":"2024-09-09","location":"Milan, Italy"},"file":[{"file_id":"18165","content_type":"application/pdf","success":1,"file_size":650495,"creator":"dernst","access_level":"open_access","date_created":"2024-10-01T09:56:54Z","file_name":"2024_LNCS_Chatterjee.pdf","checksum":"223845be9e754681ee218866827c95e7","date_updated":"2024-10-01T09:56:54Z","relation":"main_file"}],"quality_controlled":"1","supplementarymaterial":"no","volume":14933,"page":"600-619","das_tickbox":"1","ec_funded":1,"day":"11","isi":1,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Goharshady","first_name":"Ehsan","full_name":"Goharshady, Ehsan"},{"last_name":"Karrabi","orcid":"0009-0007-5253-9170","id":"67638922-f394-11eb-9cf6-f20423e08757","first_name":"Mehrdad","full_name":"Karrabi, Mehrdad"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde"}]},{"OA_type":"green","day":"24","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Amir","full_name":" Kafshdar Goharshady, Amir","last_name":" Kafshdar Goharshady"},{"last_name":"Kafshdar Goharshady","full_name":"Kafshdar Goharshady, Ehsan","first_name":"Ehsan"},{"last_name":"Karrabi","full_name":"Karrabi, Mehrdad","first_name":"Mehrdad"},{"full_name":"Žikelić, Ðorđe","first_name":"Ðorđe","last_name":"Žikelić"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06","oa_version":"None","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.12518216","open_access":"1"}],"OA_place":"repository","oa":1,"title":"Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs","date_published":"2024-06-24T00:00:00Z","date_created":"2026-09-03T11:50:15Z","type":"research_data_reference","related_material":{"record":[{"id":"18155","status":"public","relation":"used_in_publication"}]},"_id":"22798","publisher":"Repository","ddc":["000"],"date_updated":"2026-10-16T07:29:39Z","year":"2024","status":"public","department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee, A. Kafshdar Goharshady, E. Kafshdar Goharshady, M. Karrabi, and Ð. Žikelić, “Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs.” Repository, 2024.","ista":"Chatterjee K, Kafshdar Goharshady A, Kafshdar Goharshady E, Karrabi M, Žikelić Ð. 2024. Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs, Repository, 10.5281/zenodo.12518216.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, and Ðorđe Žikelić. “Data for Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” Repository, 2024. https://doi.org/10.5281/zenodo.12518216.","short":"K. Chatterjee, A. Kafshdar Goharshady, E. Kafshdar Goharshady, M. Karrabi, Ð. Žikelić, (2024).","ama":"Chatterjee K, Kafshdar Goharshady A, Kafshdar Goharshady E, Karrabi M, Žikelić Ð. Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. 2024. doi:10.5281/zenodo.12518216","mla":"Chatterjee, Krishnendu, et al. Data for Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. Repository, 2024, doi:10.5281/zenodo.12518216.","apa":"Chatterjee, K., Kafshdar Goharshady, A., Kafshdar Goharshady, E., Karrabi, M., & Žikelić, Ð. (2024). Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. Repository. https://doi.org/10.5281/zenodo.12518216"},"doi":"10.5281/zenodo.12518216","abstract":[{"lang":"eng","text":"This repository contains the artifact of the paper titled \"Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs\" accepted at FM 2024.\r\n\r\nThe task of verifying an LTL formula on a program can be reduced to verifying a Büchi specification on the product transition system. This tool takes a non-deterministic transition system together with a Büchi specification as input and based on user preferences tries to either (i) prove the existence of a run in the program that satisfies the Büchi condition or (ii) demonstrate that every run of the program satisfies the Büchi condition.\r\n \r\nThe tool is written in Java and works well with openjdk 11 on Ubuntu 22.04. Running all the experiments can take weeks to finish. We have provided a script for running the strongest configuration of our tool which solves most of the benchmarks and takes less than 48 hours. Detailed guidance is given in the readme file."}],"fulldoi":"https://doi.org/10.5281/zenodo.12518216","article_processing_charge":"No"},{"issue":"50","type":"journal_article","related_material":{"record":[{"status":"public","id":"20138","relation":"dissertation_contains"}]},"intvolume":" 121","year":"2024","status":"public","researchdata_availability":"yes","oa":1,"date_published":"2024-12-10T00:00:00Z","date_created":"2024-12-22T23:01:47Z","publication":"Proceedings of the National Academy of Sciences of the United States of America","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication_status":"published","fulldoi":"https://doi.org/10.1073/pnas.2405605121","quality_controlled":"1","file":[{"success":1,"content_type":"application/pdf","file_id":"18721","creator":"dernst","file_size":2491151,"file_name":"2024_PNAS_Svoboda.pdf","access_level":"open_access","date_created":"2025-01-02T12:14:15Z","checksum":"0115e9090b478e0644308c6dab58605b","date_updated":"2025-01-02T12:14:15Z","relation":"main_file"}],"article_type":"original","OA_type":"hybrid","pmid":1,"volume":121,"supplementarymaterial":"yes","das_tickbox":"1","ec_funded":1,"OA_place":"publisher","day":"10","author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"isi":1,"acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.","APC_amount":"3143,76 EUR","external_id":{"isi":["001379596100014"],"pmid":["39642209"]},"_id":"18703","publisher":"National Academy of Sciences","date_updated":"2026-10-16T08:00:05Z","ddc":["000"],"title":"Density amplifiers of cooperation for spatial games","citation":{"apa":"Svoboda, J., & Chatterjee, K. (2024). Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2405605121","mla":"Svoboda, Jakub, and Krishnendu Chatterjee. “Density Amplifiers of Cooperation for Spatial Games.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 50, e2405605121, National Academy of Sciences, 2024, doi:10.1073/pnas.2405605121.","ama":"Svoboda J, Chatterjee K. Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(50). doi:10.1073/pnas.2405605121","chicago":"Svoboda, Jakub, and Krishnendu Chatterjee. “Density Amplifiers of Cooperation for Spatial Games.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2405605121.","short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","ista":"Svoboda J, Chatterjee K. 2024. Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. 121(50), e2405605121.","ieee":"J. Svoboda and K. Chatterjee, “Density amplifiers of cooperation for spatial games,” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 50. National Academy of Sciences, 2024."},"file_date_updated":"2025-01-02T12:14:15Z","doi":"10.1073/pnas.2405605121","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"abstract":[{"text":"Spatial games provide a simple and elegant mathematical model to study the evolution of cooperation in networks. In spatial games, individuals reside in vertices, adopt simple strategies, and interact with neighbors to receive a payoff. Depending on their own and neighbors’ payoffs, individuals can change their strategy. The payoff is determined by the Prisoners’ Dilemma, a classical matrix game, where players cooperate or defect. While cooperation is the desired behavior, defection provides a higher payoff for a selfish individual. There are many theoretical and empirical studies related to the role of the network in the evolution of cooperation. However, the fundamental question of whether there exist networks that for low initial cooperation rate ensure a high chance of fixation, i.e., cooperation spreads across the whole population, has remained elusive for spatial games with strong selection. In this work, we answer this fundamental question in the affirmative by presenting network structures that ensure high fixation probability for cooperators in the strong selection regime. Besides, our structures have many desirable properties: (a) they ensure the spread of cooperation even for a low initial density of cooperation and high temptation of defection, (b) they have constant degrees, and (c) the number of steps, until cooperation spreads, is at most quadratic in the size of the network.","lang":"eng"}],"article_processing_charge":"Yes","has_accepted_license":"1","department":[{"_id":"KrCh"}],"corr_author":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"article_number":"e2405605121","dataavailabilitystatement":"Code data have been deposited in Code: Amplifiers of Cooperation (DOI: https://doi.org/10.5281/zenodo.10832535)","oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"month":"12","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"11","language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"Published Version","project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"corr_author":"1","alternative_title":["LMCS"],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"DOAJ_listed":"1","article_processing_charge":"Yes","doi":"10.46298/lmcs-20(4:11)2024","file_date_updated":"2024-12-09T08:38:48Z","citation":{"ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” Logical Methods in Computer Science, vol. 20, no. 4. EPI Sciences, p. 11:1-11:34, 2024.","ista":"Chatterjee K, Doyen L. 2024. Stochastic processes with expected stopping time. Logical Methods in Computer Science. 20(4), 11:1-11:34.","short":"K. Chatterjee, L. Doyen, Logical Methods in Computer Science 20 (2024) 11:1-11:34.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Logical Methods in Computer Science. EPI Sciences, 2024. https://doi.org/10.46298/lmcs-20(4:11)2024.","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. Logical Methods in Computer Science. 2024;20(4):11:1-11:34. doi:10.46298/lmcs-20(4:11)2024","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Logical Methods in Computer Science, vol. 20, no. 4, EPI Sciences, 2024, p. 11:1-11:34, doi:10.46298/lmcs-20(4:11)2024.","apa":"Chatterjee, K., & Doyen, L. (2024). Stochastic processes with expected stopping time. Logical Methods in Computer Science. EPI Sciences. https://doi.org/10.46298/lmcs-20(4:11)2024"},"abstract":[{"text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.","lang":"eng"}],"publication_identifier":{"eissn":["1860-5974"]},"title":"Stochastic processes with expected stopping time","publisher":"EPI Sciences","_id":"18630","ddc":["000"],"date_updated":"2026-10-16T07:57:38Z","acknowledgement":"The authors are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. The research presented in this paper was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","external_id":{"arxiv":["2104.07278"],"isi":["001367316400002"]},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"isi":1,"day":"12","ec_funded":1,"OA_place":"publisher","das_tickbox":"0","page":"11:1-11:34","volume":20,"supplementarymaterial":"no","article_type":"original","OA_type":"gold","quality_controlled":"1","file":[{"file_id":"18633","content_type":"application/pdf","success":1,"file_size":416814,"creator":"dernst","access_level":"open_access","date_created":"2024-12-09T08:38:48Z","file_name":"2024_LMCS_Chatterjee.pdf","checksum":"b3315c74ce18ce0a30ed33d8c9972992","date_updated":"2024-12-09T08:38:48Z","relation":"main_file"}],"arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.46298/lmcs-20(4:11)2024","publication":"Logical Methods in Computer Science","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2024-12-08T23:01:56Z","oa":1,"date_published":"2024-11-12T00:00:00Z","intvolume":" 20","related_material":{"record":[{"id":"10004","status":"public","relation":"earlier_version"}]},"status":"public","researchdata_availability":"no","year":"2024","issue":"4","type":"journal_article"},{"related_material":{"record":[{"relation":"research_data","status":"public","id":"23142"}]},"intvolume":" 14550","year":"2024","status":"public","researchdata_availability":"yes","type":"conference","date_created":"2024-12-01T23:01:53Z","oa":1,"date_published":"2024-11-01T00:00:00Z","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1007/978-3-031-67695-6_4","publication":"TOOLympics Challenge 2023","OA_type":"green","quality_controlled":"1","volume":14550,"supplementarymaterial":"no","OA_place":"repository","das_tickbox":"1","page":"90-146","author":[{"first_name":"Roman","full_name":"Andriushchenko, Roman","last_name":"Andriushchenko"},{"last_name":"Bork","first_name":"Alexander","full_name":"Bork, Alexander"},{"first_name":"Carlos E.","full_name":"Budde, Carlos E.","last_name":"Budde"},{"last_name":"Češka","full_name":"Češka, Milan","first_name":"Milan"},{"last_name":"Grover","full_name":"Grover, Kush","first_name":"Kush"},{"last_name":"Hahn","full_name":"Hahn, Ernst Moritz","first_name":"Ernst Moritz"},{"first_name":"Arnd","full_name":"Hartmanns, Arnd","last_name":"Hartmanns"},{"last_name":"Israelsen","first_name":"Bryant","full_name":"Israelsen, Bryant"},{"last_name":"Jansen","full_name":"Jansen, Nils","first_name":"Nils"},{"last_name":"Jeppson","first_name":"Joshua","full_name":"Jeppson, Joshua"},{"last_name":"Junges","first_name":"Sebastian","full_name":"Junges, Sebastian"},{"first_name":"Maximilian A.","full_name":"Köhl, Maximilian A.","last_name":"Köhl"},{"first_name":"Bettina","full_name":"Könighofer, Bettina","last_name":"Könighofer"},{"full_name":"Kretinsky, Jan","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"full_name":"Parker, David","first_name":"David","last_name":"Parker"},{"first_name":"Stefan","full_name":"Pranger, Stefan","last_name":"Pranger"},{"full_name":"Quatmann, Tim","first_name":"Tim","last_name":"Quatmann"},{"full_name":"Ruijters, Enno","first_name":"Enno","last_name":"Ruijters"},{"last_name":"Taylor","first_name":"Landon","full_name":"Taylor, Landon"},{"first_name":"Matthias","full_name":"Volk, Matthias","last_name":"Volk"},{"first_name":"Maximilian","full_name":"Weininger, Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","orcid":"0000-0002-0163-2152","last_name":"Weininger"},{"last_name":"Zhang","first_name":"Zhen","full_name":"Zhang, Zhen"}],"isi":1,"day":"01","publisher":"Springer Nature","_id":"18600","date_updated":"2026-10-16T07:53:26Z","acknowledgement":"The authors are ordered alphabetically. This work was supported by DFG RTG 2236/2 (UnRAVeL) and DFG project TRR 248 (CPEC, ID 389792660), by the EU under MSCA grant agreements 101008233 (MISSION), 101034413 (IST-BRIDGE), and 101067199 (ProSVED), by ERC Starting Grant 101077178 (DEUCE), ERC Consolidator Grant 864075 (CAESAR), and ERC Advanced Grant 834115 (FUN2MODEL), by GAČR grant GA23-06963S (VESCAA), by National Science Foundation grant 1856733, by NextGenerationEU project D53D23008400006 (SMARTITUDE), and by NWO VENI grant 639.021.754.","external_id":{"isi":["001434957500004"],"arxiv":["2405.13583"]},"title":"Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report","article_processing_charge":"No","doi":"10.1007/978-3-031-67695-6_4","citation":{"ieee":"R. Andriushchenko et al., “Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report,” in TOOLympics Challenge 2023, 2024, vol. 14550, pp. 90–146.","ista":"Andriushchenko R, Bork A, Budde CE, Češka M, Grover K, Hahn EM, Hartmanns A, Israelsen B, Jansen N, Jeppson J, Junges S, Köhl MA, Könighofer B, Kretinsky J, Meggendorfer T, Parker D, Pranger S, Quatmann T, Ruijters E, Taylor L, Volk M, Weininger M, Zhang Z. 2024. Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report. TOOLympics Challenge 2023. , LNCS, vol. 14550, 90–146.","short":"R. Andriushchenko, A. Bork, C.E. Budde, M. Češka, K. Grover, E.M. Hahn, A. Hartmanns, B. Israelsen, N. Jansen, J. Jeppson, S. Junges, M.A. Köhl, B. Könighofer, J. Kretinsky, T. Meggendorfer, D. Parker, S. Pranger, T. Quatmann, E. Ruijters, L. Taylor, M. Volk, M. Weininger, Z. Zhang, in:, TOOLympics Challenge 2023, Springer Nature, 2024, pp. 90–146.","chicago":"Andriushchenko, Roman, Alexander Bork, Carlos E. Budde, Milan Češka, Kush Grover, Ernst Moritz Hahn, Arnd Hartmanns, et al. “Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report.” In TOOLympics Challenge 2023, 14550:90–146. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-67695-6_4.","ama":"Andriushchenko R, Bork A, Budde CE, et al. Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report. In: TOOLympics Challenge 2023. Vol 14550. Springer Nature; 2024:90-146. doi:10.1007/978-3-031-67695-6_4","mla":"Andriushchenko, Roman, et al. “Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report.” TOOLympics Challenge 2023, vol. 14550, Springer Nature, 2024, pp. 90–146, doi:10.1007/978-3-031-67695-6_4.","apa":"Andriushchenko, R., Bork, A., Budde, C. E., Češka, M., Grover, K., Hahn, E. M., … Zhang, Z. (2024). Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report. In TOOLympics Challenge 2023 (Vol. 14550, pp. 90–146). Springer Nature. https://doi.org/10.1007/978-3-031-67695-6_4"},"publication_identifier":{"isbn":["9783031676949"],"eissn":["1611-3349"],"issn":["0302-9743"]},"abstract":[{"lang":"eng","text":"The analysis of formal models that include quantitative aspects such as timing or probabilistic choices is performed by quantitative verification tools. Broad and mature tool support is available for computing basic properties such as expected rewards on basic models such as Markov chains. Previous editions of QComp, the comparison of tools for the analysis of quantitative formal models, focused on this setting. Many application scenarios, however, require more advanced property types such as LTL and parameter synthesis queries as well as advanced models like stochastic games and partially observable MDPs. For these, tool support is in its infancy today. This paper presents the outcomes of QComp 2023: a survey of the state of the art in quantitative verification tool support for advanced property types and models. With tools ranging from first research prototypes to well-supported integrations into established toolsets, this report highlights today’s active areas and tomorrow’s challenges in tool-focused research for quantitative verification."}],"alternative_title":["LNCS"],"department":[{"_id":"KrCh"}],"dataavailabilitystatement":"All model files used for the comparison, as well as the resulting log files, are available at DOI 10.5281/zenodo.8219191","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2405.13583"}],"oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"11","language":[{"iso":"eng"}],"scopus_import":"1"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","fulldoi":"https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5","arxiv":1,"publication_status":"published","conference":{"start_date":"2024-12-16","end_date":"2024-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Gujarat, India"},"type":"conference","year":"2024","status":"public","researchdata_availability":"no","intvolume":" 323","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"23079"}]},"date_published":"2024-12-05T00:00:00Z","oa":1,"date_created":"2024-06-03T07:44:27Z","das_tickbox":"0","OA_place":"publisher","ec_funded":1,"day":"05","isi":1,"author":[{"id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","full_name":"Asadi, Ali","first_name":"Ali"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","orcid":"0000-0002-1419-3267","first_name":"Jakub","full_name":"Svoboda, Jakub"}],"file":[{"content_type":"application/pdf","file_id":"18777","success":1,"file_size":847960,"creator":"dernst","access_level":"open_access","date_created":"2025-01-08T09:49:31Z","file_name":"2024_LIPIcs_Asadi.pdf","checksum":"5b544ab4692b93300b404435c036ddd4","relation":"main_file","date_updated":"2025-01-08T09:49:31Z"}],"quality_controlled":"1","OA_type":"gold","supplementarymaterial":"no","volume":323,"abstract":[{"lang":"eng","text":"We study two-player zero-sum concurrent stochastic games with finite state and action space played for an infinite number of steps. In every step, the two players simultaneously and independently choose an action. Given the current state and the chosen actions, the next state is obtained according to a stochastic transition function. An objective is a measurable function on plays (or infinite trajectories) of the game, and the value for an objective is the maximal expectation that the player can guarantee against the adversarial player. We consider: (a) stateful-discounted objectives, which are similar to the classical discounted-sum objectives, but states are associated with different discount factors rather than a single discount factor; and (b) parity objectives, which are a canonical representation for ω-regular objectives. For stateful-discounted objectives, given an ordering of the discount factors, the limit value is the limit of the value of the stateful-discounted objectives, as the discount factors approach zero according to the given order.\r\nThe computational problem we consider is the approximation of the value within an arbitrary\r\nadditive error. The above problem is known to be in EXPSPACE for the limit value of statefuldiscounted objectives and in PSPACE for parity objectives. The best-known algorithms for both the above problems are at least exponential time, with an exponential dependence on the number of states and actions. Our main results for the value approximation problem for the limit value of stateful-discounted objectives and parity objectives are as follows: (a) we establish TFNP[NP] complexity; and (b) we present algorithms that improve the dependency on the number of actions in the exponent from linear to logarithmic. In particular, if the number of states is constant, our algorithms run in polynomial time."}],"publication_identifier":{"isbn":["9783959773553"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.FSTTCS.2024.5","citation":{"ama":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.FSTTCS.2024.5","chicago":"Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5.","short":"A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, J. Svoboda, in:, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. 2024. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 323, 5.","ieee":"A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. Svoboda, “Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms,” in 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Gujarat, India, 2024, vol. 323.","apa":"Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Svoboda, J. (2024). Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 323). Gujarat, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5","mla":"Asadi, Ali, et al. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 323, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.FSTTCS.2024.5."},"file_date_updated":"2025-01-08T09:49:31Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"has_accepted_license":"1","alternative_title":["LIPIcs"],"corr_author":"1","external_id":{"isi":["001537516500005"],"arxiv":["2405.02486"]},"acknowledgement":"This research was partially supported by ERC CoG 863818 (ForM-SMArt), Austrian\r\nScience Fund (FWF) 10.55776/COE12, and French Agence Nationale de la Recherche (ANR)\r\nANR-21-CE40-0020 (CONVERGENCE project)","date_updated":"2026-10-16T08:00:46Z","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"17099","title":"Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms","oa_version":"Published Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"12","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"article_number":"5"},{"date_published":"2024-09-01T00:00:00Z","oa":1,"date_created":"2024-09-29T22:01:38Z","type":"conference","status":"public","year":"2024","researchdata_availability":"no","conference":{"location":"Jeju, Korea","start_date":"2024-08-03","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2024-08-09"},"publication":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","fulldoi":"https://doi.org/10.24963/ijcai.2024/1","publication_status":"published","arxiv":1,"supplementarymaterial":"no","quality_controlled":"1","day":"01","author":[{"first_name":"S","full_name":"Akshay, S","last_name":"Akshay"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Meggendorfer, Tobias","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer"},{"orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"page":"3-12","das_tickbox":"0","ec_funded":1,"title":"Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties","external_id":{"arxiv":["2405.04015"]},"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt), the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant, Google Research Award 2023 and the SBI Foundation Hub for Data and Analytics.","date_updated":"2026-10-16T08:08:15Z","publisher":"International Joint Conferences on Artificial Intelligence","_id":"18159","department":[{"_id":"KrCh"}],"corr_author":"1","abstract":[{"text":"Markov Decision Processes (MDPs) are a classical model for decision making in the presence of uncertainty. Often they are viewed as state transformers with planning objectives defned with respect to paths over MDP states. An increasingly\r\npopular alternative is to view them as distribution transformers, giving rise to a sequence of probability distributions over MDP states. For instance, reachability and safety properties in modeling robot swarms or chemical reaction networks are naturally defned in terms of probability distributions over states. Verifying such distributional properties is known to be hard and often beyond the reach of classical state-based verifcation techniques. In this work, we consider the problems of certifed policy (i.e. controller) verifcation and synthesis in MDPs under distributional reach-avoidance specifcations. By certifed we mean that, along with a policy, we also aim to synthesize a (checkable) certifcate ensuring that the MDP indeed satisfes the property. Thus, given the target set of distributions and an unsafe set of distributions over MDP states, our goal is to either synthesize a certifcate for a given policy or synthesize a policy along with a certifcate, proving that the target distribution can be reached while avoiding unsafe distributions. To solve this problem, we introduce the novel notion of distributional reach-avoid certifcates and present automated procedures for (1) synthesizing a certifcate for a given policy, and (2) synthesizing a policy together with the certifcate, both providing formal guarantees on certifcate correctness. Our experimental evaluation demonstrates the ability of our method to solve several non-trivial examples, including a multi-agent robot-swarm model, to synthesize certifed policies and to certify existing policies. ","lang":"eng"}],"publication_identifier":{"issn":["1045-0823"],"isbn":["9781956792041"]},"citation":{"short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12.","chicago":"Akshay, S, Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.” In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 3–12. International Joint Conferences on Artificial Intelligence, 2024. https://doi.org/10.24963/ijcai.2024/1.","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2024:3-12. doi:10.24963/ijcai.2024/1","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties,” in Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, Jeju, Korea, 2024, pp. 3–12.","ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2024. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 3–12.","mla":"Akshay, S., et al. “Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.” Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12, doi:10.24963/ijcai.2024/1.","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2024). Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (pp. 3–12). Jeju, Korea: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/1"},"doi":"10.24963/ijcai.2024/1","article_processing_charge":"No","project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"scopus_import":"1","month":"09","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.04015"}]},{"supplementarymaterial":"no","volume":63,"OA_type":"hybrid","article_type":"original","file":[{"success":1,"file_id":"18781","content_type":"application/pdf","creator":"dernst","file_size":2614190,"file_name":"2024_FromMethodsSys_Chatterjee.pdf","access_level":"open_access","date_created":"2025-01-09T07:31:31Z","checksum":"111e76b76163640a2c89237642af586f","relation":"main_file","date_updated":"2025-01-09T07:31:31Z"}],"quality_controlled":"1","isi":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Joost P","full_name":"Katoen, Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6143-1926"},{"first_name":"Stefanie","full_name":"Mohr, Stefanie","last_name":"Mohr"},{"full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"}],"day":"01","OA_place":"publisher","ec_funded":1,"page":"40-80","das_tickbox":"1","date_created":"2023-03-19T23:00:59Z","date_published":"2024-10-01T00:00:00Z","oa":1,"status":"public","year":"2024","researchdata_availability":"yes","related_material":{"record":[{"id":"8272","status":"public","relation":"earlier_version"}]},"intvolume":" 63","type":"journal_article","fulldoi":"https://doi.org/10.1007/s10703-023-00411-4","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Formal Methods in System Design","dataavailabilitystatement":"The software and data used to generate the experimental results of this paper are available online(See https://doi.org/10.5281/zenodo.5798108 and https://doi.org/10.5281/zenodo.7233605 for the experiments described in Sect. 5.1 and Sect. 5.2, respectively.).","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"10","scopus_import":"1","oa_version":"Published Version","title":"Stochastic games with lexicographic objectives","date_updated":"2026-10-16T08:04:16Z","ddc":["000"],"_id":"12738","publisher":"Springer Nature","external_id":{"isi":["000946174300001"]},"acknowledgement":"Tobias Winkler and Joost-Pieter Katoen are supported by the DFG RTG 2236 UnRAVeL and the innovation programme under the Marie Skłodowska-Curie grant agreement No. 101008233 (Mission). Krishnendu Chatterjee is supported by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) Project ICT15-003. Maximilian Weininger is supported by the DFG projects 383882557 Statistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic Verification (GOPro). Stefanie Mohr is supported by the DFG RTG 2428 CONVEY. Open Access funding enabled and organized by Projekt DEAL.","department":[{"_id":"KrCh"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1572-8102"]},"abstract":[{"lang":"eng","text":"We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP, matching the current known bound for single objectives; and in general the decision problem is PSPACE-hard and can be solved in NEXPTIME∩coNEXPTIME. We present an algorithm that computes the lexicographically optimal strategies via a reduction to the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies."}],"doi":"10.1007/s10703-023-00411-4","file_date_updated":"2025-01-09T07:31:31Z","citation":{"apa":"Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2024). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. https://doi.org/10.1007/s10703-023-00411-4","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design, vol. 63, Springer Nature, 2024, pp. 40–80, doi:10.1007/s10703-023-00411-4.","ama":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. Stochastic games with lexicographic objectives. Formal Methods in System Design. 2024;63:40-80. doi:10.1007/s10703-023-00411-4","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design. Springer Nature, 2024. https://doi.org/10.1007/s10703-023-00411-4.","short":"K. Chatterjee, J.P. Katoen, S. Mohr, M. Weininger, T. Winkler, Formal Methods in System Design 63 (2024) 40–80.","ista":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2024. Stochastic games with lexicographic objectives. Formal Methods in System Design. 63, 40–80.","ieee":"K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” Formal Methods in System Design, vol. 63. Springer Nature, pp. 40–80, 2024."}},{"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.13912"}],"oa_version":"Preprint","title":"Solving long-run average reward robust MDPs via stochastic games","date_updated":"2026-10-16T08:07:05Z","publisher":"International Joint Conferences on Artificial Intelligence","_id":"18160","external_id":{"arxiv":["2312.13912"]},"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Czech Science Foundation\r\ngrant no. GA23-06963S.","corr_author":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"No","abstract":[{"text":"Markov decision processes (MDPs) provide a standard framework for sequential decision making under uncertainty. However, MDPs do not take uncertainty in transition probabilities into account. Robust Markov decision processes (RMDPs) address this shortcoming of MDPs by assigning to each transition an uncertainty set rather than a single probability value. In this work, we consider polytopic RMDPs in which all uncertainty sets are polytopes and study the problem of solving long-run average reward polytopic RMDPs. We present a novel perspective on this problem and show that it can be reduced to solving long-run average reward turn-based stochastic games with finite state and action spaces. This reduction allows us to derive several important consequences that were hitherto not known to hold for polytopic RMDPs. First, we derive new computational complexity bounds for solving long-run average reward polytopic RMDPs, showing for the first time that the threshold decision problem for them is in NP∩CONP and that they admit a randomized algorithm with sub-exponential expected runtime. Second, we present Robust Polytopic Policy Iteration (RPPI), a novel policy iteration algorithm for solving long-run average reward polytopic RMDPs. Our experimental evaluation shows that RPPI is much more efficient in solving long-run average reward polytopic RMDPs compared to state-of-the-art methods based on value iteration. ","lang":"eng"}],"publication_identifier":{"issn":["1045-0823"],"isbn":["9781956792041"]},"citation":{"ista":"Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. 2024. Solving long-run average reward robust MDPs via stochastic games. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715.","ieee":"K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, and D. Zikelic, “Solving long-run average reward robust MDPs via stochastic games,” in 33rd International Joint Conference on Artificial Intelligence, Jeju, South Korea, 2024, pp. 6707–6715.","ama":"Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. Solving long-run average reward robust MDPs via stochastic games. In: 33rd International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2024:6707-6715. doi:10.24963/ijcai.2024/741","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Mehrdad Karrabi, Petr Novotný, and Dorde Zikelic. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” In 33rd International Joint Conference on Artificial Intelligence, 6707–15. International Joint Conferences on Artificial Intelligence, 2024. https://doi.org/10.24963/ijcai.2024/741.","short":"K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.","apa":"Chatterjee, K., Goharshady, E., Karrabi, M., Novotný, P., & Zikelic, D. (2024). Solving long-run average reward robust MDPs via stochastic games. In 33rd International Joint Conference on Artificial Intelligence (pp. 6707–6715). Jeju, South Korea: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/741","mla":"Chatterjee, Krishnendu, et al. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–15, doi:10.24963/ijcai.2024/741."},"doi":"10.24963/ijcai.2024/741","supplementarymaterial":"no","OA_type":"green","quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Kafshdar Goharshadi","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587","first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan"},{"full_name":"Karrabi, Mehrdad","first_name":"Mehrdad","id":"67638922-f394-11eb-9cf6-f20423e08757","last_name":"Karrabi","orcid":"0009-0007-5253-9170"},{"full_name":"Novotný, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"day":"01","OA_place":"repository","ec_funded":1,"page":"6707-6715","das_tickbox":"0","date_created":"2024-09-29T22:01:39Z","date_published":"2024-09-01T00:00:00Z","oa":1,"year":"2024","status":"public","researchdata_availability":"no","type":"conference","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2024-08-09","start_date":"2024-08-03","location":"Jeju, South Korea"},"fulldoi":"https://doi.org/10.24963/ijcai.2024/741","arxiv":1,"publication_status":"published","publication":"33rd International Joint Conference on Artificial Intelligence"},{"title":"Entropic risk for turn-based stochastic games","publisher":"Elsevier","_id":"17474","ddc":["000"],"date_updated":"2026-10-16T08:04:31Z","acknowledgement":"Krishnendu Chatterjee reports financial support was provided by European Research Council.","external_id":{"arxiv":["2307.06611"],"isi":["001301143400001"]},"corr_author":"1","has_accepted_license":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"Yes (in subscription journal)","citation":{"ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” Information and Computation, vol. 301. Elsevier, 2024.","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2024. Entropic risk for turn-based stochastic games. Information and Computation. 301, 105214.","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, Information and Computation 301 (2024).","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” Information and Computation. Elsevier, 2024. https://doi.org/10.1016/j.ic.2024.105214.","ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. Information and Computation. 2024;301. doi:10.1016/j.ic.2024.105214","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” Information and Computation, vol. 301, 105214, Elsevier, 2024, doi:10.1016/j.ic.2024.105214.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2024). Entropic risk for turn-based stochastic games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2024.105214"},"file_date_updated":"2025-01-09T13:49:03Z","doi":"10.1016/j.ic.2024.105214","publication_identifier":{"eissn":["1090-2651"],"issn":["0890-5401"]},"abstract":[{"text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. Furthermore, an approximation algorithm for the optimal value of ERisk is provided.","lang":"eng"}],"article_number":"105214","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"12","scopus_import":"1","oa_version":"Published Version","date_created":"2024-09-01T22:01:07Z","oa":1,"date_published":"2024-12-01T00:00:00Z","intvolume":" 301","related_material":{"record":[{"relation":"earlier_version","id":"14417","status":"public"}]},"status":"public","researchdata_availability":"no","year":"2024","type":"journal_article","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1016/j.ic.2024.105214","publication":"Information and Computation","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":301,"supplementarymaterial":"no","article_type":"original","OA_type":"hybrid","quality_controlled":"1","file":[{"file_name":"2024_InformationComputation_Baier.pdf","date_created":"2025-01-09T13:49:03Z","access_level":"open_access","relation":"main_file","date_updated":"2025-01-09T13:49:03Z","checksum":"f68e0c2f46f9b9c86815406bcf2ee2d4","success":1,"file_id":"18817","content_type":"application/pdf","creator":"dernst","file_size":724703}],"author":[{"first_name":"Christel","full_name":"Baier, Christel","last_name":"Baier"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Meggendorfer, Tobias","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer"},{"first_name":"Jakob","full_name":"Piribauer, Jakob","last_name":"Piribauer"}],"isi":1,"day":"01","OA_place":"publisher","das_tickbox":"0"},{"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"_id":"bd622a5c-d553-11ed-ba76-bae280ba8aff","name":"Graphical Games","grant_number":"894907"}],"main_file_link":[{"open_access":"1","url":"https://schmiste.github.io/noms24.pdf"}],"oa_version":"Submitted Version","month":"05","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","publisher":"IEEE","_id":"18925","date_updated":"2026-10-16T08:07:55Z","acknowledgement":"Research was supported by the Austrian Science Fund (FWF), project I 5025-N (DELTA), 2020-2024. Esra Ceylan’s research was supported by FFG, FEMtech Praktika für Studentinnen. Jakub Svoboda and Krishnendu Chatterjee were supported by the European Research Council (ERC) CoG 863818 (ForM-SMArt).","external_id":{"isi":["001270140300143"]},"title":"Congestion-free rerouting of network flows: Hardness and an FPT algorithm","article_processing_charge":"No","citation":{"ieee":"E. Ceylan, K. Chatterjee, S. Schmid, and J. Svoboda, “Congestion-free rerouting of network flows: Hardness and an FPT algorithm,” in NOMS 2024-2024 IEEE Network Operations and Management Symposium, Seoul, Republic of Korea, 2024.","ista":"Ceylan E, Chatterjee K, Schmid S, Svoboda J. 2024. Congestion-free rerouting of network flows: Hardness and an FPT algorithm. NOMS 2024-2024 IEEE Network Operations and Management Symposium. NOMS: Network Operations and Management Symposiu .","short":"E. Ceylan, K. Chatterjee, S. Schmid, J. Svoboda, in:, NOMS 2024-2024 IEEE Network Operations and Management Symposium, IEEE, 2024.","chicago":"Ceylan, Esra, Krishnendu Chatterjee, Stefan Schmid, and Jakub Svoboda. “Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm.” In NOMS 2024-2024 IEEE Network Operations and Management Symposium. IEEE, 2024. https://doi.org/10.1109/noms59830.2024.10575579.","ama":"Ceylan E, Chatterjee K, Schmid S, Svoboda J. Congestion-free rerouting of network flows: Hardness and an FPT algorithm. In: NOMS 2024-2024 IEEE Network Operations and Management Symposium. IEEE; 2024. doi:10.1109/noms59830.2024.10575579","mla":"Ceylan, Esra, et al. “Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm.” NOMS 2024-2024 IEEE Network Operations and Management Symposium, IEEE, 2024, doi:10.1109/noms59830.2024.10575579.","apa":"Ceylan, E., Chatterjee, K., Schmid, S., & Svoboda, J. (2024). Congestion-free rerouting of network flows: Hardness and an FPT algorithm. In NOMS 2024-2024 IEEE Network Operations and Management Symposium. Seoul, Republic of Korea: IEEE. https://doi.org/10.1109/noms59830.2024.10575579"},"doi":"10.1109/noms59830.2024.10575579","publication_identifier":{"isbn":["9798350327946"],"eissn":["2374-9709"]},"abstract":[{"text":"Given the increasingly stringent requirements on the performance and efficiency of communication networks, over the last years, great efforts have been made to render networks more flexible and programmable. In particular, modern networks support a flexible rerouting of flows, e.g., depending on the dynamically changing traffic or network conditions. However, the underlying algorithmic problems are still not well-understood today.In this paper, we revisit the k-Network Flow Update problem that asks for a schedule to reroute k unsplittable flows from their current paths to the given new paths, in a congestion-free manner in a capacitated network. We show that the problem is already NP-hard for three acyclic flows on simple directed graphs. Our main contribution is an efficient algorithm for sparse networks; specifically the algorithm is fixed parameter tractable in the number of flows and the treewidth of a graph that is the union of all flows. Our results also settle the open complexity question in the literature.","lang":"eng"}],"corr_author":"1","department":[{"_id":"KrCh"}],"OA_type":"green","quality_controlled":"1","supplementarymaterial":"no","ec_funded":1,"OA_place":"other","das_tickbox":"0","author":[{"id":"cb1ca1d8-dcc0-11ef-baa5-9f1b3ef75933","last_name":"Ceylan","first_name":"Esra","full_name":"Ceylan, Esra"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Svoboda, Jakub","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","last_name":"Svoboda"}],"isi":1,"day":"01","year":"2024","status":"public","researchdata_availability":"no","type":"conference","date_created":"2025-01-27T15:06:45Z","oa":1,"date_published":"2024-05-01T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1109/noms59830.2024.10575579","publication":"NOMS 2024-2024 IEEE Network Operations and Management Symposium","conference":{"start_date":"2024-05-06","end_date":"2024-05-10","name":"NOMS: Network Operations and Management Symposiu ","location":"Seoul, Republic of Korea"}},{"type":"conference","status":"public","researchdata_availability":"no","year":"2024","date_published":"2024-06-17T00:00:00Z","oa":1,"date_created":"2024-07-28T22:01:10Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing","fulldoi":"https://doi.org/10.1145/3662158.3662769","publication_status":"published","arxiv":1,"conference":{"end_date":"2024-06-21","name":"PODC: Symposium on Principles of Distributed Computing","start_date":"2024-06-17","location":"Nantes, France"},"file":[{"file_id":"17334","content_type":"application/pdf","success":1,"file_size":832034,"creator":"dernst","date_created":"2024-07-29T07:18:12Z","access_level":"open_access","file_name":"2024_ACM_Chatterjee.pdf","date_updated":"2024-07-29T07:18:12Z","relation":"main_file","checksum":"6122bd97b42751ff81c452a19970f67d"}],"quality_controlled":"1","supplementarymaterial":"no","page":"268-278","das_tickbox":"0","ec_funded":1,"day":"17","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Ebrahimzadeh","full_name":"Ebrahimzadeh, Amirali","first_name":"Amirali"},{"first_name":"Mehrdad","full_name":"Karrabi, Mehrdad","orcid":"0009-0007-5253-9170","id":"67638922-f394-11eb-9cf6-f20423e08757","last_name":"Karrabi"},{"first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"},{"orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X","full_name":"Yeo, Michelle X"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"external_id":{"arxiv":["2405.04420"]},"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) grant and the MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms) grant.\r\n","date_updated":"2026-10-16T08:09:09Z","ddc":["000"],"publisher":"Association for Computing Machinery","_id":"17328","title":"Fully automated selfish mining analysis in efficient proof systems blockchains","abstract":[{"text":"We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems - like proofs of stake or proofs of space - and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an ϵ-tight lower bound on the optimal expected relative revenue in the MDP and a strategy that achieves this ϵ-tight lower bound, where ϵ > 0 may be any specified precision. Our analysis is fully automated and provides formal guarantees on the correctness. We evaluate our selfish mining attack and observe that it achieves superior expected relative revenue compared to two considered baselines.\r\nIn concurrent work [Sarenche FC'24] does an automated analysis on selfish mining in predictable longest-chain blockchains based on efficient proof systems. Predictable means the randomness for the challenges is fixed for many blocks (as used e.g., in Ouroboros), while we consider unpredictable (Bitcoin-like) chains where the challenge is derived from the previous block.","lang":"eng"}],"publication_identifier":{"isbn":["9798400706684"]},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains.” Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2024, pp. 268–78, doi:10.1145/3662158.3662769.","apa":"Chatterjee, K., Ebrahimzadeh, A., Karrabi, M., Pietrzak, K. Z., Yeo, M. X., & Zikelic, D. (2024). Fully automated selfish mining analysis in efficient proof systems blockchains. In Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing (pp. 268–278). Nantes, France: Association for Computing Machinery. https://doi.org/10.1145/3662158.3662769","chicago":"Chatterjee, Krishnendu, Amirali Ebrahimzadeh, Mehrdad Karrabi, Krzysztof Z Pietrzak, Michelle X Yeo, and Dorde Zikelic. “Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains.” In Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing, 268–78. Association for Computing Machinery, 2024. https://doi.org/10.1145/3662158.3662769.","short":"K. Chatterjee, A. Ebrahimzadeh, M. Karrabi, K.Z. Pietrzak, M.X. Yeo, D. Zikelic, in:, Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2024, pp. 268–278.","ama":"Chatterjee K, Ebrahimzadeh A, Karrabi M, Pietrzak KZ, Yeo MX, Zikelic D. Fully automated selfish mining analysis in efficient proof systems blockchains. In: Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2024:268-278. doi:10.1145/3662158.3662769","ieee":"K. Chatterjee, A. Ebrahimzadeh, M. Karrabi, K. Z. Pietrzak, M. X. Yeo, and D. Zikelic, “Fully automated selfish mining analysis in efficient proof systems blockchains,” in Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing, Nantes, France, 2024, pp. 268–278.","ista":"Chatterjee K, Ebrahimzadeh A, Karrabi M, Pietrzak KZ, Yeo MX, Zikelic D. 2024. Fully automated selfish mining analysis in efficient proof systems blockchains. Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 268–278."},"file_date_updated":"2024-07-29T07:18:12Z","doi":"10.1145/3662158.3662769","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"has_accepted_license":"1","corr_author":"1","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"oa_version":"Published Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"06"},{"das_tickbox":"0","author":[{"first_name":"Orestis","full_name":"Alpos, Orestis","last_name":"Alpos"},{"last_name":"Amores-Sesar","first_name":"Ignacio","full_name":"Amores-Sesar, Ignacio"},{"last_name":"Cachin","first_name":"Christian","full_name":"Cachin, Christian"},{"full_name":"Yeo, Michelle X","first_name":"Michelle X","last_name":"Yeo","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"day":"18","quality_controlled":"1","file":[{"file_size":1505994,"creator":"dernst","content_type":"application/pdf","file_id":"15031","success":1,"relation":"main_file","date_updated":"2024-02-26T10:16:57Z","checksum":"2993e810a45e8c8056106834b07aea92","date_created":"2024-02-26T10:16:57Z","access_level":"open_access","file_name":"2024_LIPICs_Alpos.pdf"}],"volume":286,"supplementarymaterial":"no","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.4230/LIPIcs.OPODIS.2023.12","publication":"27th International Conference on Principles of Distributed Systems","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"end_date":"2023-12-08","name":"OPODIS: Conference on Principles of Distributed Systems","start_date":"2023-12-06","location":"Tokyo, Japan"},"intvolume":" 286","researchdata_availability":"no","status":"public","year":"2024","type":"conference","date_created":"2024-02-18T23:01:02Z","oa":1,"date_published":"2024-01-18T00:00:00Z","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","language":[{"iso":"eng"}],"scopus_import":"1","article_number":"12","article_processing_charge":"No","citation":{"ieee":"O. Alpos, I. Amores-Sesar, C. Cachin, and M. X. Yeo, “Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.","ista":"Alpos O, Amores-Sesar I, Cachin C, Yeo MX. 2024. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 12.","short":"O. Alpos, I. Amores-Sesar, C. Cachin, M.X. Yeo, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","chicago":"Alpos, Orestis, Ignacio Amores-Sesar, Christian Cachin, and Michelle X Yeo. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.12.","ama":"Alpos O, Amores-Sesar I, Cachin C, Yeo MX. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In: 27th International Conference on Principles of Distributed Systems. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.OPODIS.2023.12","mla":"Alpos, Orestis, et al. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.” 27th International Conference on Principles of Distributed Systems, vol. 286, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.12.","apa":"Alpos, O., Amores-Sesar, I., Cachin, C., & Yeo, M. X. (2024). Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2023.12"},"doi":"10.4230/LIPIcs.OPODIS.2023.12","file_date_updated":"2024-02-26T10:16:57Z","abstract":[{"lang":"eng","text":"Traditional blockchains grant the miner of a block full control not only over which transactions but also their order. This constitutes a major flaw discovered with the introduction of decentralized finance and allows miners to perform MEV attacks. In this paper, we address the issue of sandwich attacks by providing a construction that takes as input a blockchain protocol and outputs a new blockchain protocol with the same security but in which sandwich attacks are not profitable. Furthermore, our protocol is fully decentralized with no trusted third parties or heavy cryptography primitives and carries a linear increase in latency and minimum computation overhead."}],"publication_identifier":{"isbn":["9783959773089"],"issn":["1868-8969"]},"alternative_title":["LIPIcs"],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"KrPi"}],"_id":"15007","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"],"date_updated":"2026-10-16T08:10:21Z","acknowledgement":"We would like to thank Krzysztof Pietrzak and Jovana Mićić for useful discussions. This work has been funded by the Swiss National Science Foundation (SNSF) under grant agreement Nr. 200021_188443 (Advanced Consensus Protocols).\r\n","external_id":{"isi":["001585185800012"],"arxiv":["2307.02954"]},"title":"Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks"},{"quality_controlled":"1","supplementarymaterial":"no","volume":14653,"page":"315-344","das_tickbox":"0","isi":1,"author":[{"full_name":"Auerbach, Benedikt","first_name":"Benedikt","last_name":"Auerbach","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425"},{"id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","last_name":"Günther","first_name":"Christoph Ullrich","full_name":"Günther, Christoph Ullrich"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"day":"01","year":"2024","status":"public","researchdata_availability":"no","intvolume":" 14653","type":"conference","date_created":"2024-05-26T22:00:58Z","date_published":"2024-05-01T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-031-58734-4_11","publication_status":"published","publication":"43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques","conference":{"start_date":"2024-05-26","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2024-05-30","location":"Zurich, Switzerland"},"project":[{"grant_number":"F8509","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","name":"Security and Privacy by Design for Complex Systems"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2024/312"}],"oa_version":"Preprint","month":"05","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","date_updated":"2026-10-16T08:09:46Z","_id":"17051","publisher":"Springer Nature","external_id":{"isi":["001274940200011"]},"acknowledgement":"We thank the Eurocrypt reviewers for their thorough review and for pointing out related works. This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85.","title":"Trapdoor memory-hard functions","article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031587337"]},"abstract":[{"text":"Memory-hard functions (MHF) are functions whose evaluation provably requires\r\na lot of memory. While MHFs are an unkeyed primitive, it is natural to consider the\r\nnotion of trapdoor MHFs (TMHFs). A TMHF is like an MHF, but when sampling\r\nthe public parameters one also samples a trapdoor which allows evaluating the\r\nfunction much cheaper.\r\nBiryukov and Perrin (Asiacrypt’17) were the first to consider TMHFs and put\r\nforth a candidate TMHF construction called Diodon that is based on the Scrypt\r\nMHF (Percival, BSDCan’09). To allow for a trapdoor, Scrypt’s initial hash chain\r\nis replaced by a sequence of squares in a group of unknown order where the order of\r\nthe group is the trapdoor. For a length n sequence of squares and a group of order\r\nN, Diodon’s cumulative memory complexity (CMC) is O(n2log N) without the\r\ntrapdoor and O(n log(n) log(N)2) with knowledge of it.\r\nWhile Scrypt is proven to be optimally memory-hard in the random oracle\r\nmodel (Alwen et al., Eurocrypt’17), Diodon’s memory-hardness has not been\r\nproven so far. In this work, we fill this gap by rigorously analyzing a specific\r\ninstantiation of Diodon. We show that its CMC is lower bounded by Ω( n2log nlog N)\r\nwhich almost matches the upper bound. Our proof is based Alwen et al.’s lower\r\nbound on Scrypt’s CMC but requires non-trivial modifications due to the algebraic\r\nstructure of Diodon. Most importantly, our analysis involves a more elaborate\r\ncompression argument and a solvability criterion for certain systems of Diophantine\r\nequations.","lang":"eng"}],"doi":"10.1007/978-3-031-58734-4_11","citation":{"ieee":"B. Auerbach, C. U. Günther, and K. Z. Pietrzak, “Trapdoor memory-hard functions,” in 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, 2024, vol. 14653, pp. 315–344.","ista":"Auerbach B, Günther CU, Pietrzak KZ. 2024. Trapdoor memory-hard functions. 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 14653, 315–344.","short":"B. Auerbach, C.U. Günther, K.Z. Pietrzak, in:, 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Nature, 2024, pp. 315–344.","chicago":"Auerbach, Benedikt, Christoph Ullrich Günther, and Krzysztof Z Pietrzak. “Trapdoor Memory-Hard Functions.” In 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 14653:315–44. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-58734-4_11.","ama":"Auerbach B, Günther CU, Pietrzak KZ. Trapdoor memory-hard functions. In: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques. Vol 14653. Springer Nature; 2024:315-344. doi:10.1007/978-3-031-58734-4_11","mla":"Auerbach, Benedikt, et al. “Trapdoor Memory-Hard Functions.” 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 14653, Springer Nature, 2024, pp. 315–44, doi:10.1007/978-3-031-58734-4_11.","apa":"Auerbach, B., Günther, C. U., & Pietrzak, K. Z. (2024). Trapdoor memory-hard functions. In 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (Vol. 14653, pp. 315–344). Zurich, Switzerland: Springer Nature. https://doi.org/10.1007/978-3-031-58734-4_11"},"corr_author":"1","alternative_title":["LNCS"],"department":[{"_id":"KrPi"}]},{"das_tickbox":"0","ec_funded":1,"OA_place":"publisher","day":"20","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","last_name":"Kafshdar Goharshadi","orcid":"0000-0002-8595-0587","first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan"},{"full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"quality_controlled":"1","file":[{"access_level":"open_access","date_created":"2024-07-22T07:17:14Z","file_name":"2024_ACMProgLang_Chatterjee.pdf","checksum":"8cbf220f284a4a87d093db5320c5afdd","relation":"main_file","date_updated":"2024-07-22T07:17:14Z","file_id":"17290","content_type":"application/pdf","success":1,"file_size":355421,"creator":"dernst"}],"article_type":"original","OA_type":"hybrid","volume":8,"supplementarymaterial":"no","publication":"Proceedings of the ACM on Programming Languages","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1145/3656462","type":"journal_article","intvolume":" 8","researchdata_availability":"no","status":"public","year":"2024","oa":1,"date_published":"2024-06-20T00:00:00Z","date_created":"2024-07-21T22:01:01Z","oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"article_number":"232","doi":"10.1145/3656462","citation":{"ieee":"K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Equivalence and similarity refutation for probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8. Association for Computing Machinery, 2024.","ista":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2024. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 8, 232.","short":"K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic. “Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2024. https://doi.org/10.1145/3656462.","ama":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8. doi:10.1145/3656462","mla":"Chatterjee, Krishnendu, et al. “Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, 232, Association for Computing Machinery, 2024, doi:10.1145/3656462.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462"},"file_date_updated":"2024-07-22T07:17:14Z","publication_identifier":{"eissn":["2475-1421"]},"abstract":[{"lang":"eng","text":"We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two fundamental relational properties of probabilistic programs that are essential for their correctness both in implementation and in compilation. In this work, we present a new method for static equivalence and similarity refutation. Our method refutes equivalence and similarity by computing a function over program outputs whose expected value with respect to the output distributions of two programs is different. The function is computed simultaneously with an upper expectation supermartingale and a lower expectation submartingale for the two programs, which we show to together provide a formal certificate for refuting equivalence and similarity. To the best of our knowledge, our method is the first approach to relational program analysis to offer the combination of the following desirable features: (1) it is fully automated, (2) it is applicable to infinite-state probabilistic programs, and (3) it provides formal guarantees on the correctness of its results. We implement a prototype of our method and our experiments demonstrate the effectiveness of our method to refute equivalence and similarity for a number of examples collected from the literature."}],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"corr_author":"1","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant. Petr Novotný\r\nis supported by the Czech Science Foundation grant no. GA23-06963S.\r\n","external_id":{"arxiv":["2404.03430"]},"publisher":"Association for Computing Machinery","_id":"17283","date_updated":"2026-10-16T08:08:51Z","ddc":["000"],"title":"Equivalence and similarity refutation for probabilistic programs"},{"quality_controlled":"1","file":[{"relation":"main_file","date_updated":"2024-07-16T12:02:25Z","checksum":"efd5b7e738bf845312ba53889a3e13e4","date_created":"2024-07-16T12:02:25Z","access_level":"open_access","file_name":"2024_TheorComputerScience_Schmid.pdf","file_size":603570,"creator":"dernst","file_id":"17263","content_type":"application/pdf","success":1}],"article_type":"original","volume":989,"supplementarymaterial":"no","das_tickbox":"0","ec_funded":1,"day":"21","author":[{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Svoboda","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub"},{"first_name":"Michelle X","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809","last_name":"Yeo"}],"isi":1,"type":"journal_article","intvolume":" 989","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"19985"}]},"status":"public","researchdata_availability":"no","year":"2024","oa":1,"date_published":"2024-03-21T00:00:00Z","date_created":"2024-01-16T13:40:41Z","publication":"Theoretical Computer Science","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","fulldoi":"https://doi.org/10.1016/j.tcs.2023.114353","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"article_number":"114353","oa_version":"Published Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"03","language":[{"iso":"eng"}],"acknowledgement":"We thank Mahsa Bastankhah and Mohammad Ali Maddah-Ali for fruitful discussions about different variants of the problem. This work is supported by the European Research Council (ERC) Consolidator Project 864228 (AdjustNet), 2020-2025, the ERC CoG 863818 (ForM-SMArt), and the German Research Foundation (DFG) grant 470029389 (FlexNets), 2021-2024.","external_id":{"isi":["001168211400001"]},"_id":"14820","publisher":"Elsevier","date_updated":"2026-10-16T08:09:27Z","ddc":["000"],"title":"Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation","file_date_updated":"2024-07-16T12:02:25Z","citation":{"mla":"Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” Theoretical Computer Science, vol. 989, 114353, Elsevier, 2024, doi:10.1016/j.tcs.2023.114353.","apa":"Schmid, S., Svoboda, J., & Yeo, M. X. (2024). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2023.114353","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” Theoretical Computer Science. Elsevier, 2024. https://doi.org/10.1016/j.tcs.2023.114353.","short":"S. Schmid, J. Svoboda, M.X. Yeo, Theoretical Computer Science 989 (2024).","ama":"Schmid S, Svoboda J, Yeo MX. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. 2024;989. doi:10.1016/j.tcs.2023.114353","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” Theoretical Computer Science, vol. 989. Elsevier, 2024.","ista":"Schmid S, Svoboda J, Yeo MX. 2024. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. 989, 114353."},"doi":"10.1016/j.tcs.2023.114353","publication_identifier":{"issn":["0304-3975"]},"abstract":[{"text":"We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how many nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v's capacity on \r\n increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes' decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1+E) . (1+3) for some arbitrary E>0.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"corr_author":"1","keyword":["General Computer Science","Theoretical Computer Science"]}]