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 

Hirvonen, J., Schmid, L., Chatterjee, K., &; Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. 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.11 

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. Proceedings of the National Academy of Sciences.https://doi.org/10.1073/pnas.2315558121 

Hübner, V., &; Kleshnina, M. (2024). Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.”https://doi.org/10.5281/ZENODO.10639167__Zenodo.https://doi.org/10.5281/ZENODO.10639167 

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 

Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., &; Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977554.ch173 

Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems  (Vol. 13993, pp. 3–25). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_1 

Svoboda, J., Tkadlec, J., Kaveh, K., &; Chatterjee, K. (2023). Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society.https://doi.org/10.1098/rspa.2022.0685 

Schmid, L., Ekbatani, F., Hilbe, C., &; Chatterjee, K. (2023). Quantitative assessment can stabilize indirect reciprocity under imperfect information. Nature Communications. Springer Nature.https://doi.org/10.1038/s41467-023-37817-x 

Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., &; Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i12.26747 

Avni, G., Jecker, I. R., &; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States.https://doi.org/10.1609/aaai.v37i5.25679 

Kretinsky, J., Meggendorfer, T., Prokop, M., &; Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification  (Vol. 13964, pp. 390–414). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37706-8_20 

Sun, Y., Fu, H., Chatterjee, K., &; Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_2 

Akshay, S., Chatterjee, K., Meggendorfer, T., &; Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_5 

Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., &; Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature.https://doi.org/10.1007/s10703-023-00411-4 

Graham, T., Kleshnina, M., &; Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. Springer Nature.https://doi.org/10.1007/s13235-022-00425-3 

Baier, C., Chatterjee, K., Meggendorfer, T., &; Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2023.15 

Mckerral, J. C., Kleshnina, M., Ejov, V., Bartle, L., Mitchell, J. G., &; Filar, J. A. (2023). Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0279838 

Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press.https://doi.org/10.3233/FAIA230264 

Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature.https://doi.org/10.1007/978-3-031-45329-8_17 

Schmid, S., Svoboda, J., &; Yeo, M. X. (2023). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In SIROCCO 2023: Structural Information and Communication Complexity  (Vol. 13892, pp. 576–594). Alcala de Henares, Spain: Springer Nature.https://doi.org/10.1007/978-3-031-32733-9_26 

Tkadlec, J., Kaveh, K., Chatterjee, K., &; Nowak, M. A. (2023). Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. The Royal Society.https://doi.org/10.1098/rsif.2023.0355 

Kleshnina, M., Hilbe, C., Simsa, S., Chatterjee, K., &; Nowak, M. A. (2023). The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. Springer Nature.https://doi.org/10.1038/s41467-023-39625-9 

Kleshnina, M. (2023). kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games. Zenodo.https://doi.org/10.5281/ZENODO.8059564 

Kretinsky, J., Meggendorfer, T., &; Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In 38th Annual ACM/IEEE Symposium on Logic in Computer Science (Vol. 2023). Boston, MA, United States: Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/LICS56636.2023.10175771 

Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D.,https://doi.org/10.46298/DMTCS.8383__Turcotte, A. (2023). Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. EPI Sciences.https://doi.org/10.46298/DMTCS.8383 

Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &; Yeo, M. X. (2023). : Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature.https://doi.org/10.1007/978-3-031-47754-6_18 

Zikelic, D. (2023). Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria.https://doi.org/10.15479/14539 

Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., &; Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery.https://doi.org/10.1145/3585391 

Kisan, J. M., &; Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In 24th International Symposium on Fundamentals of Computation Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-43587-4_24 

Zikelic, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i10.26407 

Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_25 

Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo.https://doi.org/10.5281/ZENODO.7548214 

Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.

Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., &; Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 

Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i9.21222 

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.7155/jgaa.00591__Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00591 

Chatterjee, K., Mohammadi, M., &; Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv.https://doi.org/10.48550/ARXIV.2209.14368 

Kretinsky, J., Meggendorfer, T., Waldmann, C., &; Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature.https://doi.org/10.1007/s00236-021-00412-y 

Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &; Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature.https://doi.org/10.1038/s41598-022-05333-5 

Zikelic, D., Chang, B.-Y. E., Bolignano, P., &; Raimondi, F. (2022). Differential cost analysis with simultaneous potentials and anti-potentials. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 442–457). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3519939.3523435 

Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., &; Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society.https://doi.org/10.1103/physreve.106.034321 

Schmid, L., Hilbe, C., Chatterjee, K., &; Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1010149 

Chatterjee, K., Saona Urmeneta, R. J., &; Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences.https://doi.org/10.1287/moor.2020.1116 

Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature.https://doi.org/10.1007/978-3-031-19992-9_20 

Chatterjee, K., &; Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2022.04.003 

Grover, K., Kretinsky, J., Meggendorfer, T., &; Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory  (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2022.11 

Chatterjee, K., Goharshady, A. K., Meggendorfer, T., &; Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer.https://doi.org/10.1007/978-3-031-13185-1_4 

Lechner, M., Zikelic, D., Chatterjee, K., &; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i7.20695