Raimundo Saona

Orcid: 0000-0001-5103-038X

According to our database1, Raimundo Saona authored at least 18 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Random Zero-Sum Dynamic Games on Infinite Directed Graphs.
Dyn. Games Appl., November, 2025

Value-Positivity for Matrix Games.
Math. Oper. Res., 2025

Marginal Values of a Stochastic Game.
Math. Oper. Res., 2025

Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete.
Proceedings of the Conference on Uncertainty in Artificial Intelligence, 2025

Value Iteration with Guessing for Markov Chains and Markov Decision Processes.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2025

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Linear Equations with Min and Max Operators: Computational Complexity.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Ergodic Unobservable MDPs: Decidability of Approximation.
CoRR, 2024

Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
Prophet Inequalities: Separating Random Order from Order Selection.
CoRR, 2023

Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.
Math. Oper. Res., 2022

Repeated Prophet Inequality with Near-optimal Bounds.
CoRR, 2022

2019
The Complexity of POMDPs with Long-run Average Objectives.
CoRR, 2019

Prophet Secretary Through Blind Strategies.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Conditional predictive Bayesian Cramér-Rao Lower Bounds for prognostic algorithms design.
Appl. Soft Comput., 2018


  Loading...