Ali Asadi
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20299 | 
Asadi, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20297 |
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Svoboda, J. (2024). 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). Gujarat, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, 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.)
| WoS
| arXiv
Grants
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20299 |
Asadi, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20297 |
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Svoboda, J. (2024). 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). Gujarat, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, 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.)
| WoS
| arXiv