Ali Asadi

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi, A., Chatterjee, K., Goharshady, E., Karrabi, M., & Shafiee, A. (2026). Qualitative analysis of ω-regular objectives on robust MDPs. In Proceedings of the 40th AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36137–36145). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. 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, A., Chatterjee, K., Lurie, D., & Saona Urmeneta, R. J. (2026). Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36146–36154). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. 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, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Chatterjee, K., & Kebis, P. (2026). 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). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A. (2026). Approximation of values and equilibria in stochastic games: Complexity and algorithms. Institute of Science and Technology Austria. 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, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.
[Published Version] View | Files available | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi, A., Brice, L., Chatterjee, K., & Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Chatterjee, K., Svoboda, J., & Saona Urmeneta, R. J. (2024). Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Tallinn, Estonia: Association for Computing Machinery. 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, A., Chatterjee, K., Saona Urmeneta, R. J., & Svoboda, J. (2024). 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). Gujarat, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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: APA

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi, A., Chatterjee, K., Goharshady, E., Karrabi, M., & Shafiee, A. (2026). Qualitative analysis of ω-regular objectives on robust MDPs. In Proceedings of the 40th AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36137–36145). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. 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, A., Chatterjee, K., Lurie, D., & Saona Urmeneta, R. J. (2026). Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36146–36154). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. 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, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Chatterjee, K., & Kebis, P. (2026). 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). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A. (2026). Approximation of values and equilibria in stochastic games: Complexity and algorithms. Institute of Science and Technology Austria. 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, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.
[Published Version] View | Files available | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi, A., Brice, L., Chatterjee, K., & Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Chatterjee, K., Svoboda, J., & Saona Urmeneta, R. J. (2024). Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Tallinn, Estonia: Association for Computing Machinery. 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, A., Chatterjee, K., Saona Urmeneta, R. J., & Svoboda, J. (2024). 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). Gujarat, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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: APA

Export / Embed