Ali Asadi

7 Publications

Mark all

[7]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, and A. Shafiee, “Qualitative analysis of ω-regular objectives on robust MDPs,” in Proceedings of the 40th AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36137–36145.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2026 | Published | Conference Paper | IST-REx-ID: 21722
A. Asadi, K. Chatterjee, D. Lurie, and R. J. Saona Urmeneta, “Revealing POMDPs: Qualitative and quantitative analysis for parity objectives,” in Proceedings of the AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36146–36154.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Pilani, India, 2025, vol. 360, p. 9:1-9:17.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure reachability for small memory policies in POMDPs is NP-complete,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 238–247.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.
[Published Version] View | Files available | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
A. Asadi, K. Chatterjee, J. Svoboda, and R. 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, Tallinn, Estonia, 2024.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. 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, Gujarat, India, 2024, vol. 323.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


7 Publications

Mark all

[7]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, and A. Shafiee, “Qualitative analysis of ω-regular objectives on robust MDPs,” in Proceedings of the 40th AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36137–36145.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2026 | Published | Conference Paper | IST-REx-ID: 21722
A. Asadi, K. Chatterjee, D. Lurie, and R. J. Saona Urmeneta, “Revealing POMDPs: Qualitative and quantitative analysis for parity objectives,” in Proceedings of the AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36146–36154.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Pilani, India, 2025, vol. 360, p. 9:1-9:17.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure reachability for small memory policies in POMDPs is NP-complete,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 238–247.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.
[Published Version] View | Files available | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
A. Asadi, K. Chatterjee, J. Svoboda, and R. 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, Tallinn, Estonia, 2024.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. 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, Gujarat, India, 2024, vol. 323.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed