Ali Asadi

7 Publications

Mark all

[7]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi A, Chatterjee K, Goharshady E, Karrabi M, Shafiee A. Qualitative analysis of ω-regular objectives on robust MDPs. In: Proceedings of the 40th AAAI Conference on Artificial Intelligence. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36137-36145. doi:10.1609/aaai.v40i43.40931
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2026 | Published | Conference Paper | IST-REx-ID: 21722
Asadi A, Chatterjee K, Lurie D, Saona Urmeneta RJ. Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36146-36154. doi:10.1609/aaai.v40i43.40932
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:10.4230/lipics.fsttcs.2025.9
[Published Version] View | Files available | DOI | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability for small memory policies in POMDPs is NP-complete. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:238-247.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:223-232.
[Published Version] View | Files available | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 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. doi:10.1145/3661814.3662080
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. 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. doi:10.4230/LIPIcs.FSTTCS.2024.5
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


7 Publications

Mark all

[7]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi A, Chatterjee K, Goharshady E, Karrabi M, Shafiee A. Qualitative analysis of ω-regular objectives on robust MDPs. In: Proceedings of the 40th AAAI Conference on Artificial Intelligence. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36137-36145. doi:10.1609/aaai.v40i43.40931
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2026 | Published | Conference Paper | IST-REx-ID: 21722
Asadi A, Chatterjee K, Lurie D, Saona Urmeneta RJ. Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36146-36154. doi:10.1609/aaai.v40i43.40932
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:10.4230/lipics.fsttcs.2025.9
[Published Version] View | Files available | DOI | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability for small memory policies in POMDPs is NP-complete. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:238-247.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:223-232.
[Published Version] View | Files available | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 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. doi:10.1145/3661814.3662080
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. 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. doi:10.4230/LIPIcs.FSTTCS.2024.5
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed