World's Best Scientists 2026 revealed!
Michael L. Littman

Michael L. Littman

D-Index & Metrics

Computer Science

D-Index
91
Citations
54131
World Ranking
559
National Ranking
296

Research.com Recognitions

  • 2018 - ACM Fellow For contributions to the design and analysis of sequential decision making algorithms in artificial intelligence
  • 2010 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to the fields of reinforcement learning, decision making under uncertainty, and statistical language applications.

Overview

Michael L. Littman is affiliated with Brown University in the United States. Their primary research field is Computer Science, with a focus on multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Management Science and Operations Research, Cognitive Neuroscience, and Software.

The scientist's main research topics cover a range of areas such as Reinforcement Learning in Robotics, Machine Learning and Algorithms, Formal Methods in Verification, Adversarial Robustness in Machine Learning, Evolutionary Algorithms and Applications, Explainable Artificial Intelligence (XAI), and Machine Learning and Data Classification.

Recent publications by Michael L. Littman include the following papers:

  • Gathering Strength, Gathering Storms: The One Hundred Year Study on Artificial Intelligence (AI100) 2021 Study Panel Report, 2022, arXiv (Cornell University)
  • Collusion rings threaten the integrity of computer science research, 2021, Communications of the ACM

Littman has frequently collaborated with several coauthors, including:

  • George Konidaris
  • David Abel
  • Kavosh Asadi
  • Mark K. Ho
  • Shangqun Yu

Publication venues where Michael L. Littman has contributed extensively include:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Communications of the ACM
  • Proceedings of the ACM on Interactive Mobile Wearable and Ubiquitous Technologies
  • Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence

The scientist has authored books published by The MIT Press, including Code to Joy (2023).

Michael L. Littman has received professional recognition through awards such as:

  • ACM Fellow (2018) for contributions to the design and analysis of sequential decision-making algorithms in artificial intelligence
  • Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) (2010) for significant contributions to reinforcement learning, decision making under uncertainty, and statistical language applications

Best Publications

  • Reinforcement learning: a survey

    Leslie Pack Kaelbling;Michael L. Littman;Andrew W. Moore

  • Planning and Acting in Partially Observable Stochastic Domains

    Leslie Pack Kaelbling;Michael L. Littman;Anthony R. Cassandra

  • Markov games as a framework for multi-agent reinforcement learning

    Michael L. Littman

  • Measuring praise and criticism: Inference of semantic orientation from association

    Peter D. Turney;Michael L. Littman

  • Activity recognition from accelerometer data

    Nishkam Ravi;Nikhil Dandekar;Preetham Mysore;Michael L. Littman

  • Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach

    Justin A. Boyan;Michael L. Littman

  • Learning policies for partially observable environments: scaling up

    Michael L. Littman;Anthony R. Cassandra;Leslie Pack Kaelbling

  • Convergence Results for Single-Step On-PolicyReinforcement-Learning Algorithms

    Satinder Singh;Tommi Jaakkola;Michael L. Littman;Csaba Szepesvári

  • Acting Optimally in Partially Observable Stochastic Domains

    Anthony R. Cassandra;Leslie Pack Kaelbling;Michael L. Littman

  • Predictive Representations of State

    Michael L. Littman;Richard S Sutton

  • Friend-or-Foe Q-learning in General-Sum Games

    Michael L. Littman

  • Graphical models for game theory

    Michael J. Kearns;Michael L. Littman;Satinder P. Singh

  • Algorithms for Sequential Decision Making

    Michael Lederman Littman

  • On the complexity of solving Markov decision problems

    Michael L. Littman;Thomas L. Dean;Leslie Pack Kaelbling

  • PAC model-free reinforcement learning

    Alexander L. Strehl;Lihong Li;Eric Wiewiora;John Langford

  • Computerized cross-language document retrieval using latent semantic indexing

    Thomas K. Landauer;Michael L. Littman

  • Value-function reinforcement learning in Markov games

    Michael L. Littman

  • Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes

    Anthony Cassandra;Michael L. Littman;Nevin L. Zhang

  • Unsupervised Learning of Semantic Orientation from a Hundred-Billion-Word Corpus

    Peter D. Turney;Michael L. Littman

  • Data Visualization With Multidimensional Scaling

    Andreas Buja;Deborah F Swayne;Michael L Littman;Nathaniel Dean

  • An analysis of model-based Interval Estimation for Markov Decision Processes

    Alexander L. Strehl;Michael L. Littman

Frequent Co-Authors

Lihong Li
Lihong Li Amazon (United States)
Peter Stone
Peter Stone The University of Texas at Austin
Satinder Singh
Satinder Singh DeepMind (United Kingdom)
George Konidaris
George Konidaris Brown University
Thomas K. Landauer
Thomas K. Landauer University of Colorado Boulder
Peter D. Turney
Peter D. Turney Ronin Institute
Fiery Cushman
Fiery Cushman Harvard University
Thomas L. Griffiths
Thomas L. Griffiths Princeton University
Ronald Parr
Ronald Parr Duke University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science doesn’t have to follow a traditional classroom route. For those seeking flexibility, an associate degree online can provide a quick, foundational start. These programs often take as little as six months to complete and cover essential topics needed for entry-level IT roles.

Computer Science pairs well with business skills. Students interested in tech management or entrepreneurship can consider an online business degree. This pathway opens doors in project management, tech startups, and consulting roles.

Affordability is a big concern for many students. The most affordable bachelor's degree online options can significantly reduce student debt. Many accredited institutions offer flexible formats so you can work, intern, or gain real-world experience while studying.

If you are driven by technical challenges, pursuing an online engineering program is another option. There are increasingly more choices for engineering degrees that blend computing principles with applied sciences. These credentials can launch careers in tech innovation, research, and new product development.

Best Scientists Citing Michael L. Littman

Trending Scientists

Recently Published Articles