153 citations · 171 across the 12 of their papers we have counts for
3 papers · 1 filter
On-line Learning in Tree MDPs by Treating Policies as Bandit Arms
Anvay Shah, Ramsundar Anandanarayanan, Sharayu Moharir +1
A Tree Markov Decision Problem (T-MDP) is a finite-horizon MDP with a starting state , in which every state is reachable from through exactly one state-action trajec…
Efficient Computation of Blackwell Optimal Policies using Rational Functions
Dibyangshu Mukherjee, Shivaram Kalyanakrishnan
Markov Decision Problems (MDPs) provide a foundational framework for modelling sequential decision-making across diverse domains, guided by optimality criteria such as discounted a…
Howard's Policy Iteration is Subexponential for Deterministic Markov Decision Problems with Rewards of Fixed Bit-size and Arbitrary Discount Factor
Dibyangshu Mukherjee, Shivaram Kalyanakrishnan
Howard's Policy Iteration (HPI) is a classic algorithm for solving Markov Decision Problems (MDPs). HPI uses a "greedy" switching rule to update from any non-optimal policy to a do…