M. L. Littman

Papers

Total Citations

H-Index

About

Michael L. Littman is a leading figure in artificial intelligence, with foundational contributions to reinforcement learning, decision theory, and probabilistic planning. His work has profoundly shaped how machines learn to make optimal decisions in uncertain environments, particularly through the development of efficient algorithms for Markov decision processes (MDPs) and partially observable MDPs (POMDPs). Among his most celebrated achievements is the introduction of the "minimax-Q" algorithm, which extended reinforcement learning to multi-agent settings, and his pioneering research on "efficient learning in games" that bridged game theory and machine learning. With over 20,000 citations, his papers on "An Analysis of Model-Based Interval Estimation for Markov Decision Processes" and "A Survey of Monte Carlo Tree Search Methods" are seminal texts in the field. Littman’s work has been recognized with multiple best paper awards and a prestigious AAAI Fellowship. His accessible writing and commitment to open-source tools have also made complex ideas in AI more approachable for students and practitioners alike, cementing his legacy as both a rigorous scientist and a generous mentor.