Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
499 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19742 | 
C. E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15696, pp. 167–190.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19744 |
K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Research Data Reference | IST-REx-ID: 19771 |
K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Artifact: Fixed point certificates for reachability and expected rewards in MDPs.” Zenodo, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2025 | Research Data Reference | IST-REx-ID: 19769 |
C. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards (experimental reproduction package).” Zenodo, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2025 | Published | Conference Paper | IST-REx-ID: 19666 |
T. Meggendorfer, M. Weininger, and P. Wienhöft, “Solving robust Markov decision processes: Generic, reliable, efficient,” in Proceedings of the AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 25, pp. 26631–26641.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19965 |
A. Mcavoy et al., “Unilateral incentive alignment in two-agent stochastic games,” Proceedings of the National Academy of Sciences, vol. 122, no. 25. National Academy of Sciences, 2025.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2025 | Published | Conference Paper | IST-REx-ID: 19600
Z. Avarikioti, M. Bastankhah, M. A. Maddah-Ali, K. Z. Pietrzak, J. Svoboda, and M. X. Yeo, “Route discovery in private payment channel networks,” in Computer Security. ESORICS 2024 International Workshops, Bydgoszcz, Poland, 2025, vol. 15263, pp. 207–223.
View
| DOI
2025 | Published | Thesis | IST-REx-ID: 19903 |
V. Hübner, “Reciprocity and inequality in social dilemmas,” Institute of Science and Technology Austria, 2025.
[Published Version]
View
| Files available
| DOI
2025 | Published | Journal Article | IST-REx-ID: 19843 |
V. Hübner, L. Schmid, C. Hilbe, and K. Chatterjee, “Stable strategies of direct and indirect reciprocity across all social dilemmas,” PNAS Nexus, vol. 4, no. 5. Oxford University Press, 2025.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19074 |
V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, and K. Chatterjee, “Time-dependent strategies in repeated asymmetric public goods games,” Dynamic Games and Applications. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2025 | Published | Conference Paper | IST-REx-ID: 20053 |
K. Chatterjee, S. Gilbert, S. Schmid, J. Svoboda, and M. X. Yeo, “When is liquid democracy possible?: On the manipulation of variance,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025, pp. 241–251.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2024 | Submitted | Preprint | IST-REx-ID: 17101 |
L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Zero-sum random games on directed graphs,” arXiv. .
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18974 |
J. Svoboda, S. Bansal, and K. Chatterjee, “Reinforcement learning from reachability specifications: PAC guarantees with expected conditional distance,” in 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 47331–47344.
[Preprint]
View
| Download Preprint (ext.)
2024 | Published | Conference Paper | IST-REx-ID: 18159 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18160 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17328 |
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17329 |
D.-A. Alistarh, K. Chatterjee, M. Karrabi, and J. M. Lazarsfeld, “Game dynamics and equilibrium computation in the population protocol model,” in Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing, Nantes, France, 2024, pp. 40–49.
[Published Version]
View
| Files available
| DOI
2024 | Published | Journal Article | IST-REx-ID: 17162 |
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024.
[Published Version]
View
| Files available
| DOI
2024 | Published | Journal Article | IST-REx-ID: 17283 |
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 14820 |
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.
[Published Version]
View
| Files available
| DOI