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.
LibreCat: https://research-explorer.ista.ac.at/record/14243
DOI: 10.1609/aaai.v37i5.25679
arXiv: 2211.13626

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.
LibreCat: https://research-explorer.ista.ac.at/record/14259
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.
LibreCat: https://research-explorer.ista.ac.at/record/14318
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.
LibreCat: https://research-explorer.ista.ac.at/record/14317
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.
LibreCat: https://research-explorer.ista.ac.at/record/12738
DOI: 10.1007/s10703-023-00411-4
WoS: 000946174300001

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.
LibreCat: https://research-explorer.ista.ac.at/record/10770
DOI: 10.1007/s13235-022-00425-3
WoS: 000753777100001

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.
LibreCat: https://research-explorer.ista.ac.at/record/14417
DOI: 10.4230/LIPIcs.MFCS.2023.15
arXiv: 2307.06611

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.
LibreCat: https://research-explorer.ista.ac.at/record/12706
DOI: 10.1371/journal.pone.0279838
WoS: 000996122900022
PMID: 36848357

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.
LibreCat: https://research-explorer.ista.ac.at/record/14518
DOI: 10.3233/FAIA230264
arXiv: 2307.15218

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.
LibreCat: https://research-explorer.ista.ac.at/record/14559
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.
LibreCat: https://research-explorer.ista.ac.at/record/13238
DOI: 10.1007/978-3-031-32733-9_26
arXiv: 2204.13459

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.
LibreCat: https://research-explorer.ista.ac.at/record/14657
DOI: 10.1098/rsif.2023.0355
PMID: 38016637

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.
LibreCat: https://research-explorer.ista.ac.at/record/13258
DOI: 10.1038/s41467-023-39625-9
WoS: 001029450400031
PMID: 37438341

Kleshnina, Maria. Kleshnina/Stochgames_info: The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games. Zenodo, 2023, doi:10.5281/ZENODO.8059564.
LibreCat: https://research-explorer.ista.ac.at/record/13336
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.
LibreCat: https://research-explorer.ista.ac.at/record/13967
DOI: 10.1109/LICS56636.2023.10175771
WoS: 001036707700042
arXiv: 2304.09930

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.
LibreCat: https://research-explorer.ista.ac.at/record/12833
DOI: 10.46298/DMTCS.8383
arXiv: 1903.06981

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.
LibreCat: https://research-explorer.ista.ac.at/record/14736
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.
LibreCat: https://research-explorer.ista.ac.at/record/14539
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.
LibreCat: https://research-explorer.ista.ac.at/record/14778
DOI: 10.1145/3585391
arXiv: 2108.02188

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.
LibreCat: https://research-explorer.ista.ac.at/record/14456
DOI: 10.1007/978-3-031-43587-4_24
arXiv: 2307.10847

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.
LibreCat: https://research-explorer.ista.ac.at/record/14830
DOI: 10.1609/aaai.v37i10.26407
arXiv: 2210.05308

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.
LibreCat: https://research-explorer.ista.ac.at/record/13139
DOI: 10.1007/978-3-031-30823-9_25
arXiv: 2301.08137

Meggendorfer, Tobias. Artefact for: Correct Approximation of Stationary Distributions. Zenodo, 2023, doi:10.5281/ZENODO.7548214.
LibreCat: https://research-explorer.ista.ac.at/record/14990
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.
LibreCat: https://research-explorer.ista.ac.at/record/15023
arXiv: 2312.01456

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.
LibreCat: https://research-explorer.ista.ac.at/record/12102
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.
LibreCat: https://research-explorer.ista.ac.at/record/12101
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.
LibreCat: https://research-explorer.ista.ac.at/record/12568
DOI: 10.1609/aaai.v36i9.21222
arXiv: 2203.01640

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.
LibreCat: https://research-explorer.ista.ac.at/record/11938
DOI: 10.7155/jgaa.00591
arXiv: 2101.03928

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.
LibreCat: https://research-explorer.ista.ac.at/record/12677
DOI: 10.48550/ARXIV.2209.14368
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.
LibreCat: https://research-explorer.ista.ac.at/record/10602
DOI: 10.1007/s00236-021-00412-y
WoS: 000735765500001

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.
LibreCat: https://research-explorer.ista.ac.at/record/10731
DOI: 10.1038/s41598-022-05333-5
WoS: 000749198000039
arXiv: 2012.15155

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.
LibreCat: https://research-explorer.ista.ac.at/record/11459
DOI: 10.1145/3519939.3523435
WoS: 000850435600030
arXiv: 2204.00870

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.
LibreCat: https://research-explorer.ista.ac.at/record/12257
DOI: 10.1103/physreve.106.034321
WoS: 000870243100001
arXiv: 2210.02394

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.
LibreCat: https://research-explorer.ista.ac.at/record/12280
DOI: 10.1371/journal.pcbi.1010149
WoS: 000843626800031
PMID: 35700167

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.
LibreCat: https://research-explorer.ista.ac.at/record/9311
DOI: 10.1287/moor.2020.1116
WoS: 000731918100001
arXiv: 1904.13360

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.
LibreCat: https://research-explorer.ista.ac.at/record/12170
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.
LibreCat: https://research-explorer.ista.ac.at/record/11402
DOI: 10.1016/j.jcss.2022.04.003
WoS: 000805002800001
arXiv: 1802.03642

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.
LibreCat: https://research-explorer.ista.ac.at/record/12775
DOI: 10.4230/LIPIcs.CONCUR.2022.11
arXiv: 2008.04824

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.
LibreCat: https://research-explorer.ista.ac.at/record/12000
DOI: 10.1007/978-3-031-13185-1_4
WoS: 000870304500004

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.
LibreCat: https://research-explorer.ista.ac.at/record/12511
DOI: 10.1609/aaai.v36i7.20695
arXiv: 2112.09495

Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.”10.48550/arXiv.2205.11991__ArXiv, doi:10.48550/arXiv.2205.11991.
LibreCat: https://research-explorer.ista.ac.at/record/14601
DOI: 10.48550/arXiv.2205.11991
arXiv: 2205.11991

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.48550/ARXIV.2210.05308__ArXiv, doi:10.48550/ARXIV.2210.05308.
LibreCat: https://research-explorer.ista.ac.at/record/14600
DOI: 10.48550/ARXIV.2210.05308
arXiv: 2210.05308

Jecker, Ismael R., et al. “Decomposing Permutation Automata.”10.4230/LIPIcs.CONCUR.2021.18__32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”10.4230/LIPIcs.ICALP.2021.124__48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.”10.4230/LIPIcs.MFCS.2021.53__46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.
LibreCat: https://research-explorer.ista.ac.at/record/10075
DOI: 10.4230/LIPIcs.MFCS.2021.53
arXiv: 2105.02611

Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”10.4230/LIPIcs.FSTTCS.2021.34__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
LibreCat: https://research-explorer.ista.ac.at/record/10630
DOI: 10.4230/LIPIcs.FSTTCS.2021.34
arXiv: 2110.01279

Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.”10.4230/LIPIcs.FSTTCS.2021.42__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
LibreCat: https://research-explorer.ista.ac.at/record/10629
DOI: 10.4230/LIPIcs.FSTTCS.2021.42

Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.”10.1137/1.9781611976465.38__Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
LibreCat: https://research-explorer.ista.ac.at/record/10694
DOI: 10.1137/1.9781611976465.38
arXiv: 2005.06636

Tomásek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.”10.24963/ijcai.2021/575__30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.
LibreCat: https://research-explorer.ista.ac.at/record/10847
DOI: 10.24963/ijcai.2021/575

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.1007/978-3-030-68211-8_18__15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.
LibreCat: https://research-explorer.ista.ac.at/record/9296
DOI: 10.1007/978-3-030-68211-8_18
arXiv: 2101.03928