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

J. Tkadlec, K. Kaveh, K. Chatterjee, and M. A. Nowak, “Evolutionary dynamics of mutants that modify population structure,” Journal of the Royal Society, Interface, vol. 20, no. 208. The Royal Society, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14657
DOI: 10.1098/rsif.2023.0355
PMID: 38016637

M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, and M. A. Nowak, “The effect of environmental information on evolution of cooperation in stochastic games,” Nature Communications, vol. 14. Springer Nature, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/13258
DOI: 10.1038/s41467-023-39625-9
WoS: 001029450400031
PMID: 37438341

M. Kleshnina, “kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games.” Zenodo, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/13336
DOI: 10.5281/ZENODO.8059564

J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, MA, United States, 2023, vol. 2023.
LibreCat: https://research-explorer.ista.ac.at/record/13967
DOI: 10.1109/LICS56636.2023.10175771
WoS: 001036707700042
arXiv: 2304.09930

A. Biniaz et al., “Token swapping on trees,” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2. EPI Sciences, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/12833
DOI: 10.46298/DMTCS.8383
arXiv: 1903.06981

M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “: Boosting liquidity in payment channel networks with online admission control,” in 27th International Conference on Financial Cryptography and Data Security, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325.
LibreCat: https://research-explorer.ista.ac.at/record/14736
DOI: 10.1007/978-3-031-47754-6_18

D. Zikelic, “Automated verification and control of infinite state stochastic systems,” Institute of Science and Technology Austria, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14539
DOI: 10.15479/14539

K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” Formal Aspects of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14778
DOI: 10.1145/3585391
arXiv: 2108.02188

J. M. Kisan and J. Svoboda, “Shortest dominating set reconfiguration under token sliding,” in 24th International Symposium on Fundamentals of Computation Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.
LibreCat: https://research-explorer.ista.ac.at/record/14456
DOI: 10.1007/978-3-031-43587-4_24
arXiv: 2307.10847

D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935.
LibreCat: https://research-explorer.ista.ac.at/record/14830
DOI: 10.1609/aaai.v37i10.26407
arXiv: 2210.05308

T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.
LibreCat: https://research-explorer.ista.ac.at/record/13139
DOI: 10.1007/978-3-031-30823-9_25
arXiv: 2301.08137

T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14990
DOI: 10.5281/ZENODO.7548214

D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15023
arXiv: 2312.01456

A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
LibreCat: https://research-explorer.ista.ac.at/record/12102
DOI: 10.4230/LIPIcs.FSTTCS.2022.29