Ali Asadi

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Qualitative analysis of ω-regular objectives on robust MDPs
A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, A. Shafiee, in:, Proceedings of the 40th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36137–36145.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Conference Paper | IST-REx-ID: 21722 | OA
Revealing POMDPs: Qualitative and quantitative analysis for parity objectives
A. Asadi, K. Chatterjee, D. Lurie, R.J. Saona Urmeneta, in:, Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36146–36154.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
Generalized bidding games: Where bidding and stochastic games meet
A. Asadi, T.A. Henzinger, E. Goharshady, P. Kebis, K. Mallik, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22919 | OA
PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance
A. Asadi, K. Chatterjee, P. Kebis, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2026 | Published | Thesis | MS | IST-REx-ID: 23079 | OA
Approximation of values and equilibria in stochastic games: Complexity and algorithms
A. Asadi, Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms, Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Lower bound on Howard policy iteration for deterministic Markov Decision Processes
A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 223–232.
[Published Version] View | Files available | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Limit-sure reachability for small memory policies in POMDPs is NP-complete
A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, A. Shafiee, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 238–247.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
ε-stationary Nash equilibria in multi-player stochastic graph games
A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Deterministic sub-exponential algorithm for discounted-sum games with unary weights
A. Asadi, K. Chatterjee, J. Svoboda, R.J. Saona Urmeneta, in:, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Association for Computing Machinery, 2024.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms
A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, J. Svoboda, in:, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Qualitative analysis of ω-regular objectives on robust MDPs
A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, A. Shafiee, in:, Proceedings of the 40th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36137–36145.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Conference Paper | IST-REx-ID: 21722 | OA
Revealing POMDPs: Qualitative and quantitative analysis for parity objectives
A. Asadi, K. Chatterjee, D. Lurie, R.J. Saona Urmeneta, in:, Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36146–36154.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
Generalized bidding games: Where bidding and stochastic games meet
A. Asadi, T.A. Henzinger, E. Goharshady, P. Kebis, K. Mallik, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22919 | OA
PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance
A. Asadi, K. Chatterjee, P. Kebis, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2026 | Published | Thesis | MS | IST-REx-ID: 23079 | OA
Approximation of values and equilibria in stochastic games: Complexity and algorithms
A. Asadi, Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms, Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20299 | OA
Lower bound on Howard policy iteration for deterministic Markov Decision Processes
A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 223–232.
[Published Version] View | Files available | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20297 | OA
Limit-sure reachability for small memory policies in POMDPs is NP-complete
A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, A. Shafiee, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 238–247.
[Published Version] View | Files available | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
ε-stationary Nash equilibria in multi-player stochastic graph games
A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 17098 | OA
Deterministic sub-exponential algorithm for discounted-sum games with unary weights
A. Asadi, K. Chatterjee, J. Svoboda, R.J. Saona Urmeneta, in:, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Association for Computing Machinery, 2024.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms
A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, J. Svoboda, in:, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed