Ali Asadi
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20299 |
Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML Research Press, 2025.
[Published Version]
View
| Files available
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20297 |
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47. ML Research Press, 2025.
[Published Version]
View
| Files available
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17098 |
Asadi, Ali, Krishnendu Chatterjee, Jakub Svoboda, and Raimundo J Saona Urmeneta. “Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights.” In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, 2024. https://doi.org/10.1145/3661814.3662080.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Search
Filter Publications
Display / Sort
Export / Embed
Grants
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20299 |
Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML Research Press, 2025.
[Published Version]
View
| Files available
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20297 |
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47. ML Research Press, 2025.
[Published Version]
View
| Files available
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17098 |
Asadi, Ali, Krishnendu Chatterjee, Jakub Svoboda, and Raimundo J Saona Urmeneta. “Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights.” In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, 2024. https://doi.org/10.1145/3661814.3662080.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv