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.
6 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18159 | 
Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties
S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12.
2024 | Published | Conference Paper | IST-REx-ID: 18160 |
Solving long-run average reward robust MDPs via stochastic games
K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.
2021 | Published | Conference Paper | IST-REx-ID: 10847 |
Solving partially observable stochastic shortest-path games
Tomášek, Petr, Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. 2021
[Published Version]
View
| DOI
| Download Published Version (ext.)
Tomášek, Petr, Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. 2021
2018 | Published | Conference Paper | IST-REx-ID: 5977 |
Computational approaches for stochastic shortest path on succinct MDPs
Chatterjee, Krishnendu, Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence 2018. 2018
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Chatterjee, Krishnendu, Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence 2018. 2018
2017 | Published | Conference Paper | IST-REx-ID: 1003 |
An abstraction-refinement methodology for reasoning about network games
Avni, Guy, An abstraction-refinement methodology for reasoning about network games. 2017
[Submitted Version]
View
| Files available
| DOI
| WoS
Avni, Guy, An abstraction-refinement methodology for reasoning about network games. 2017
2003 | Published | Conference Paper | IST-REx-ID: 11909 |
Challenges in web search engines
M. Henzinger, R. Motwani, C. Silverstein, in:, 18th International Joint Conference on Artificial Intelligence, Association for Computing Machinery, 2003, pp. 1573–1579.
[Published Version]
View
| Download Published Version (ext.)
M. Henzinger, R. Motwani, C. Silverstein, in:, 18th International Joint Conference on Artificial Intelligence, Association for Computing Machinery, 2003, pp. 1573–1579.