Krishnendu Chatterjee

works on

decentralized learning 1 pac learning 1 private information 1 reachability objectives 1 turn-based stochastic games 1

From the 1 of 6 linked papers with an AI index.

collaborators

Showing cs.AIShow all

2 papers · 1 filter

cs.AI2026

Strongly Polynomial Time Complexity of Policy Iteration for $L_{\infty}$ Robust MDPs

Ali Asadi, Krishnendu Chatterjee, Ehsan Goharshady +3

Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilitie…

cs.AI2025

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes

Ali Asadi, Krishnendu Chatterjee, Jakob de Raaij

Deterministic Markov Decision Processes (DMDPs) are a mathematical framework for decision-making where the outcomes and future possible actions are deterministically determined by…

Strongly Polynomial Time Complexity of Policy Iteration for L∞​ Robust MDPs

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes

Strongly Polynomial Time Complexity of Policy Iteration for $L_{\infty}$ Robust MDPs