Ali Asadi
5 Publications
2025 |
Published |
Conference Paper |
IST-REx-ID: 20297 |
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
2025 |
Published |
Conference Paper |
IST-REx-ID: 20299 |
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
2025 |
Published |
Conference Paper |
IST-REx-ID: 21281 |
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
2024 |
Published |
Conference Paper |
IST-REx-ID: 17098 |
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
2024 |
Published |
Conference Paper |
IST-REx-ID: 17099 |
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
Grants
5 Publications
2025 |
Published |
Conference Paper |
IST-REx-ID: 20297 |
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
2025 |
Published |
Conference Paper |
IST-REx-ID: 20299 |
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
2025 |
Published |
Conference Paper |
IST-REx-ID: 21281 |
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
2024 |
Published |
Conference Paper |
IST-REx-ID: 17098 |
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
2024 |
Published |
Conference Paper |
IST-REx-ID: 17099 |
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