2 citations · 6 across the 13 of their papers we have counts for
Showing 2026 · cs.AIShow all
2 papers · 2 filters
cs.AI2026
Quantitative Analysis of -Regular Robust MDPs
Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady +3
Robust Markov Decision Processes (RMDPs) generalize classical MDPs by allowing uncertainty in transition probabilities and optimizing against their worst-case realization. We consi…
cs.AI2026
Automated Approach for Solving Infinite-state Polynomial Reachability Games
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +2
Reachability games are two-player games played on a graph, where the objective of player is to reach the target set whereas the objective of player…