Ali Asadi

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi, Ali, Krishnendu Chatterjee, Ehsan Goharshady, Mehrdad Karrabi, and Ali Shafiee. “Qualitative Analysis of ω-Regular Objectives on Robust MDPs.” In Proceedings of the 40th AAAI Conference on Artificial Intelligence, 40:36137–45. Association for the Advancement of Artificial Intelligence, 2026. https://doi.org/10.1609/aaai.v40i43.40931.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Conference Paper | IST-REx-ID: 21722 | OA
Asadi, Ali, Krishnendu Chatterjee, David Lurie, and Raimundo J Saona Urmeneta. “Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.” In Proceedings of the AAAI Conference on Artificial Intelligence, 40:36146–54. Association for the Advancement of Artificial Intelligence, 2026. https://doi.org/10.1609/aaai.v40i43.40932.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
Asadi, Ali, Thomas A Henzinger, Ehsan Goharshady, Pavol Kebis, and Kaushik Mallik. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22919 | OA
Asadi, Ali, Krishnendu Chatterjee, and Pavol Kebis. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2026 | Published | Thesis | MS | IST-REx-ID: 23079 | OA
Asadi, Ali. “Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-23079.
[Published Version] View | Files available | DOI
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML Research Press, 2025.
[Published Version] View | Files available | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47. ML Research Press, 2025.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi, Ali, Leonard Brice, Krishnendu 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, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.fsttcs.2025.9.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Asadi, Ali, Krishnendu Chatterjee, Jakub Svoboda, and Raimundo 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. Association for Computing Machinery, 2024. https://doi.org/10.1145/3661814.3662080.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub 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, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi, Ali, Krishnendu Chatterjee, Ehsan Goharshady, Mehrdad Karrabi, and Ali Shafiee. “Qualitative Analysis of ω-Regular Objectives on Robust MDPs.” In Proceedings of the 40th AAAI Conference on Artificial Intelligence, 40:36137–45. Association for the Advancement of Artificial Intelligence, 2026. https://doi.org/10.1609/aaai.v40i43.40931.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Conference Paper | IST-REx-ID: 21722 | OA
Asadi, Ali, Krishnendu Chatterjee, David Lurie, and Raimundo J Saona Urmeneta. “Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.” In Proceedings of the AAAI Conference on Artificial Intelligence, 40:36146–54. Association for the Advancement of Artificial Intelligence, 2026. https://doi.org/10.1609/aaai.v40i43.40932.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
Asadi, Ali, Thomas A Henzinger, Ehsan Goharshady, Pavol Kebis, and Kaushik Mallik. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22919 | OA
Asadi, Ali, Krishnendu Chatterjee, and Pavol Kebis. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2026 | Published | Thesis | MS | IST-REx-ID: 23079 | OA
Asadi, Ali. “Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-23079.
[Published Version] View | Files available | DOI
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML Research Press, 2025.
[Published Version] View | Files available | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47. ML Research Press, 2025.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi, Ali, Leonard Brice, Krishnendu 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, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.fsttcs.2025.9.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Asadi, Ali, Krishnendu Chatterjee, Jakub Svoboda, and Raimundo 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. Association for Computing Machinery, 2024. https://doi.org/10.1145/3661814.3662080.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub 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, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed