Ali Asadi

4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Asadi A, Chatterjee K, De Raaij J. 2025. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 223–232.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. 2025. Limit-sure reachability for small memory policies in POMDPs is NP-complete. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 238–247.
[Published Version] View | Files available | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. 2024. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 323, 5.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 2024. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Asadi A, Chatterjee K, De Raaij J. 2025. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 223–232.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. 2025. Limit-sure reachability for small memory policies in POMDPs is NP-complete. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 238–247.
[Published Version] View | Files available | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. 2024. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 323, 5.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 2024. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed