Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”10.1016/j.tcs.2023.114353__Theoretical Computer Science, vol. 989, 114353, Elsevier, 2024, doi:10.1016/j.tcs.2023.114353.

Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.”10.4230/LIPIcs.OPODIS.2023.11__27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.11.

Hübner, Valentin, et al. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.”10.1073/pnas.2315558121__Proceedings of the National Academy of Sciences, vol. 121, no. 10, e2315558121, Proceedings of the National Academy of Sciences, 2024, doi:10.1073/pnas.2315558121.

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.

Svoboda, Jakub, et al. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.”10.1371/journal.pcbi.1012008__PLoS Computational Biology, vol. 20, no. 3, e1012008, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1012008.

Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.”10.1137/1.9781611977554.ch173__Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:10.1137/1.9781611977554.ch173.

Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”10.1007/978-3-031-30823-9_1__Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.

Svoboda, Jakub, et al. “Coexistence Times in the Moran Process with Environmental Heterogeneity.”10.1098/rspa.2022.0685__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 479, no. 2271, 20220685, The Royal Society, 2023, doi:10.1098/rspa.2022.0685.

Schmid, Laura, et al. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.”10.1038/s41467-023-37817-x__Nature Communications, vol. 14, 2086, Springer Nature, 2023, doi:10.1038/s41467-023-37817-x.

Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.”10.1609/aaai.v37i12.26747__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:10.1609/aaai.v37i12.26747.

Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.”10.1609/aaai.v37i5.25679__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.

Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.”10.1007/978-3-031-37706-8_20__35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.

Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.”10.1007/978-3-031-37709-9_2__Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:10.1007/978-3-031-37709-9_2.

Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.”10.1007/978-3-031-37709-9_5__International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5.

Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.”10.1007/s10703-023-00411-4__Formal Methods in System Design, Springer Nature, 2023, doi:10.1007/s10703-023-00411-4.

Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.”10.1007/s13235-022-00425-3__Dynamic Games and Applications, vol. 13, Springer Nature, 2023, pp. 231–64, doi:10.1007/s13235-022-00425-3.

Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.”10.4230/LIPIcs.MFCS.2023.15__48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15.

Mckerral, Jody C., et al. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.”10.1371/journal.pone.0279838__PLoS One, vol. 18, no. 2, Public Library of Science, 2023, p. e0279838, doi:10.1371/journal.pone.0279838.

Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.”10.3233/FAIA230264__Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp. 141–48, doi:10.3233/FAIA230264.

Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”10.1007/978-3-031-45329-8_17__21st International Symposium on Automated Technology for Verification and Analysis, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:10.1007/978-3-031-45329-8_17.

Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”10.1007/978-3-031-32733-9_26__SIROCCO 2023: Structural Information and Communication Complexity , vol. 13892, Springer Nature, 2023, pp. 576–94, doi:10.1007/978-3-031-32733-9_26.

Tkadlec, Josef, et al. “Evolutionary Dynamics of Mutants That Modify Population Structure.”10.1098/rsif.2023.0355__Journal of the Royal Society, Interface, vol. 20, no. 208, 20230355, The Royal Society, 2023, doi:10.1098/rsif.2023.0355.

Kleshnina, Maria, et al. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.”10.1038/s41467-023-39625-9__Nature Communications, vol. 14, 4153, Springer Nature, 2023, doi:10.1038/s41467-023-39625-9.

Kleshnina, Maria. Kleshnina/Stochgames_info: The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games. Zenodo, 2023, doi:10.5281/ZENODO.8059564.

Kretinsky, Jan, et al. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.”10.1109/LICS56636.2023.10175771__38th Annual ACM/IEEE Symposium on Logic in Computer Science, vol. 2023, Institute of Electrical and Electronics Engineers, 2023, doi:10.1109/LICS56636.2023.10175771.

Biniaz, Ahmad, et al. “Token Swapping on Trees.”10.46298/DMTCS.8383__Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383.

Bastankhah, Mahsa, et al. “: Boosting Liquidity in Payment Channel Networks with Online Admission Control.”10.1007/978-3-031-47754-6_18__27th International Conference on Financial Cryptography and Data Security, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:10.1007/978-3-031-47754-6_18.

Zikelic, Dorde. Automated Verification and Control of Infinite State Stochastic Systems. Institute of Science and Technology Austria, 2023, doi:10.15479/14539.

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1145/3585391__Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.

Kisan, Jan Matyás, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.”10.1007/978-3-031-43587-4_24__24th International Symposium on Fundamentals of Computation Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.1609/aaai.v37i10.26407__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 10, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–35, doi:10.1609/aaai.v37i10.26407.

Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.”10.1007/978-3-031-30823-9_25__TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13993, Springer Nature, 2023, pp. 489–507, doi:10.1007/978-3-031-30823-9_25.

Meggendorfer, Tobias. Artefact for: Correct Approximation of Stationary Distributions. Zenodo, 2023, doi:10.5281/ZENODO.7548214.

Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” 37th Conference on Neural Information Processing Systems, 2023.

Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”10.4230/LIPIcs.FSTTCS.2022.29__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29.

Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.”10.4230/LIPIcs.FSTTCS.2022.11__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.

Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.”10.1609/aaai.v36i9.21222__Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.7155/jgaa.00591__Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.

Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.”10.48550/ARXIV.2209.14368__ArXiv, 2209.14368, doi:10.48550/ARXIV.2209.14368.

Kretinsky, Jan, et al. “Index Appearance Record with Preorders.”10.1007/s00236-021-00412-y__Acta Informatica, vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y.

Svoboda, Jakub, et al. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.”10.1038/s41598-022-05333-5__Scientific Reports, vol. 12, no. 1, 1526, Springer Nature, 2022, doi:10.1038/s41598-022-05333-5.

Zikelic, Dorde, et al. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.”10.1145/3519939.3523435__Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–57, doi:10.1145/3519939.3523435.

Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.”10.1103/physreve.106.034321__Physical Review E, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:10.1103/physreve.106.034321.

Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.”10.1371/journal.pcbi.1010149__PLOS Computational Biology, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:10.1371/journal.pcbi.1010149.

Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.”10.1287/moor.2020.1116__Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116.

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”10.1007/978-3-031-19992-9_20__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20.

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”10.1016/j.jcss.2022.04.003__Journal of Computer and System Sciences, vol. 129, Elsevier, 2022, pp. 1–21, doi:10.1016/j.jcss.2022.04.003.

Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”10.4230/LIPIcs.CONCUR.2022.11__33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11.

Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”10.1007/978-3-031-13185-1_4__Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.

Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.