Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




468 Publications

2024 |Published| Conference Paper | IST-REx-ID: 15006 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2024 |Published| Journal Article | IST-REx-ID: 15083 | OA
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
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
2024 | Research Data Reference | IST-REx-ID: 15108 | OA
Hübner, V., & Kleshnina, M. (2024). Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” Zenodo. https://doi.org/10.5281/ZENODO.10639167
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2024 |Epub ahead of print| Journal Article | IST-REx-ID: 17037
Attia, L., Oliu-Barton, M., & Saona Urmeneta, R. J. (2024). Marginal values of a stochastic game. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2023.0297
View | DOI
 
2024 |Submitted| Preprint | IST-REx-ID: 17099 | OA
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Svoboda, J. (n.d.). Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. arXiv. https://doi.org/10.48550/arXiv.2405.02486
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 |Submitted| Preprint | IST-REx-ID: 17101 | OA
Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (n.d.). Zero-sum random games on directed graphs. arXiv. https://doi.org/10.48550/arXiv.2401.16252
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 |Published| Journal Article | IST-REx-ID: 17162 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824
[Published Version] View | Files available | DOI
 
2024 |Published| Journal Article | IST-REx-ID: 14820 | OA
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
[Published Version] View | Files available | DOI
 
2024 |Published| Journal Article | IST-REx-ID: 17283 | OA
Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462
[Published Version] View | Files available | DOI | arXiv
 
2024 |Published| Conference Paper | IST-REx-ID: 17328 | OA
Chatterjee, K., Ebrahimzadeh, A., Karrabi, M., Pietrzak, K. Z., Yeo, M. X., & Zikelic, D. (2024). Fully automated selfish mining analysis in efficient proof systems blockchains. In Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing (pp. 268–278). Nantes, France: Association for Computing Machinery. https://doi.org/10.1145/3662158.3662769
[Published Version] View | Files available | DOI | arXiv
 
2024 |Published| Conference Paper | IST-REx-ID: 17329 | OA
Alistarh, D.-A., Chatterjee, K., Karrabi, M., & Lazarsfeld, J. M. (2024). Game dynamics and equilibrium computation in the population protocol model. In Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing (pp. 40–49). Nantes, France: Association for Computing Machinery. https://doi.org/10.1145/3662158.3662768
[Published Version] View | Files available | DOI
 
2024 |Published| Conference Paper | IST-REx-ID: 17098 | OA
Asadi, A., Chatterjee, K., Svoboda, J., & Saona Urmeneta, R. J. (2024). Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Tallinn, Estonia: Association for Computing Machinery. https://doi.org/10.1145/3661814.3662080
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 |Published| Conference Paper | IST-REx-ID: 17402 | OA
Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In 36th International Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16
[Published Version] View | Files available | DOI | arXiv
 
2024 |Published| Journal Article | IST-REx-ID: 15297 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2024 |Epub ahead of print| Journal Article | IST-REx-ID: 17474 | OA
Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2024). Entropic risk for turn-based stochastic games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2024.105214
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 12676 | OA
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
[Published Version] View | DOI | Download Published Version (ext.)
 
2023 |Published| Conference Paper | IST-REx-ID: 13142 | OA
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
[Published Version] View | Files available | DOI
 
2023 |Published| Journal Article | IST-REx-ID: 12787 | OA
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
[Published Version] View | Files available | DOI | WoS
 
2023 |Published| Journal Article | IST-REx-ID: 12861 | OA
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
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2023 |Published| Conference Paper | IST-REx-ID: 14242 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 14243 | OA
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
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 14259 | OA
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
[Published Version] View | Files available | DOI
 
2023 |Published| Conference Paper | IST-REx-ID: 14318 | OA
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
[Published Version] View | Files available | DOI
 
2023 |Published| Conference Paper | IST-REx-ID: 14317 | OA
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
[Published Version] View | Files available | DOI
 
2023 |Epub ahead of print| Journal Article | IST-REx-ID: 12738 | OA
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
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
2023 |Published| Journal Article | IST-REx-ID: 10770 | OA
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
[Published Version] View | Files available | DOI | WoS
 
2023 |Published| Journal Article | IST-REx-ID: 12706 | OA
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
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2023 |Published| Conference Paper | IST-REx-ID: 14518 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2023 |Published| Journal Article | IST-REx-ID: 14657 | OA
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
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
2023 |Published| Journal Article | IST-REx-ID: 13258 | OA
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
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2023 | Research Data Reference | IST-REx-ID: 13336 | OA
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
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2023 |Published| Conference Paper | IST-REx-ID: 13967 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 |Published| Journal Article | IST-REx-ID: 12833 | OA
Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (2023). Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. EPI Sciences. https://doi.org/10.46298/DMTCS.8383
[Published Version] View | Files available | DOI | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 14736
Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., & Yeo, M. X. (2023). R2: 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
View | DOI
 
2023 |Published| Thesis | IST-REx-ID: 14539 | OA
Zikelic, D. (2023). Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria. https://doi.org/10.15479/14539
[Published Version] View | Files available | DOI
 
2023 |Published| Conference Paper | IST-REx-ID: 14456 | OA
Křišťan, 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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 14830
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
[Preprint] View | Files available | DOI | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 13139 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. https://doi.org/10.5281/ZENODO.7548214
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2023 |Published| Journal Article | IST-REx-ID: 14778 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2023 |Submitted| Preprint | IST-REx-ID: 17100 | OA
Giambartolomei, G., Frederik Mallmann-Trenn, F. M.-T., & Saona Urmeneta, R. J. (n.d.). Prophet inequalities: Separating random order from order selection. arXiv. https://doi.org/10.48550/arXiv.2304.04024
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 15023 | OA
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.
[Published Version] View | Files available | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 14417 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2023 |Published| Conference Paper | IST-REx-ID: 14559 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 |Published| Conference Paper | IST-REx-ID: 12102 | OA
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
[Published Version] View | Files available | DOI
 
2022 |Published| Conference Paper | IST-REx-ID: 12101 | OA
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
[Published Version] View | Files available | DOI
 
2022 |Published| Conference Paper | IST-REx-ID: 12568 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 |Published| Journal Article | IST-REx-ID: 11938 | OA
Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591
[Published Version] View | Files available | DOI | arXiv
 
2022 |Submitted| Preprint | IST-REx-ID: 12677 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 |Published| Journal Article | IST-REx-ID: 10602 | OA
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
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

type<>research_data

Search

Filter Publications