L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2024.
LibreCat: https://research-explorer.ista.ac.at/record/17037
DOI: 10.1287/moor.2023.0297

A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. Svoboda, “Deterministic sub-exponential algorithm for discounted-sum games with unary weights,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/17098
DOI: 10.48550/arXiv.2405.02479
arXiv: 2405.02479

A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. Svoboda, “Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/17099
DOI: 10.48550/arXiv.2405.02486
arXiv: 2405.02486

L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Zero-sum random games on directed graphs,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/17101
DOI: 10.48550/arXiv.2401.16252
arXiv: 2401.16252

K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, pp. 4590–4605.
LibreCat: https://research-explorer.ista.ac.at/record/12676
DOI: 10.1137/1.9781611977554.ch173

K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in Tools and Algorithms for the Construction and Analysis of Systems , Paris, France, 2023, vol. 13993, pp. 3–25.
LibreCat: https://research-explorer.ista.ac.at/record/13142
DOI: 10.1007/978-3-031-30823-9_1

J. Svoboda, J. Tkadlec, K. Kaveh, and K. Chatterjee, “Coexistence times in the Moran process with environmental heterogeneity,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 479, no. 2271. The Royal Society, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/12787
DOI: 10.1098/rspa.2022.0685
WoS: 000957125500002

L. Schmid, F. Ekbatani, C. Hilbe, and K. Chatterjee, “Quantitative assessment can stabilize indirect reciprocity under imperfect information,” Nature Communications, vol. 14. Springer Nature, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/12861
DOI: 10.1038/s41467-023-37817-x
WoS: 001003644100020
PMID: 37045828

M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.
LibreCat: https://research-explorer.ista.ac.at/record/14242
DOI: 10.1609/aaai.v37i12.26747
arXiv: 2211.16187

G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
LibreCat: https://research-explorer.ista.ac.at/record/14243
DOI: 10.1609/aaai.v37i5.25679
arXiv: 2211.13626

J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.
LibreCat: https://research-explorer.ista.ac.at/record/14259
DOI: 10.1007/978-3-031-37706-8_20

Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.
LibreCat: https://research-explorer.ista.ac.at/record/14318
DOI: 10.1007/978-3-031-37709-9_2

S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112.
LibreCat: https://research-explorer.ista.ac.at/record/14317
DOI: 10.1007/978-3-031-37709-9_5

K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” Formal Methods in System Design. Springer Nature, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/12738
DOI: 10.1007/s10703-023-00411-4
WoS: 000946174300001

T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications, vol. 13. Springer Nature, pp. 231–264, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/10770
DOI: 10.1007/s13235-022-00425-3
WoS: 000753777100001

C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.
LibreCat: https://research-explorer.ista.ac.at/record/14417
DOI: 10.4230/LIPIcs.MFCS.2023.15
arXiv: 2307.06611

J. C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J. G. Mitchell, and J. A. Filar, “Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations,” PLoS One, vol. 18, no. 2. Public Library of Science, p. e0279838, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/12706
DOI: 10.1371/journal.pone.0279838
WoS: 000996122900022
PMID: 36848357

G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
LibreCat: https://research-explorer.ista.ac.at/record/14518
DOI: 10.3233/FAIA230264
arXiv: 2307.15218

M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in 21st International Symposium on Automated Technology for Verification and Analysis, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.
LibreCat: https://research-explorer.ista.ac.at/record/14559
DOI: 10.1007/978-3-031-45329-8_17

S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in SIROCCO 2023: Structural Information and Communication Complexity , Alcala de Henares, Spain, 2023, vol. 13892, pp. 576–594.
LibreCat: https://research-explorer.ista.ac.at/record/13238
DOI: 10.1007/978-3-031-32733-9_26
arXiv: 2204.13459