Revision as of 19:12, 8 June 2018

Home * People * Michael L. Littman

Michael L. Littman ^[1]

Michael Lederman Littman,
an American mathematician, computer scientist and professor of CS at Brown University, and before at Rutgers University and Duke University. He received his Ph.D. in 1996 at Brown University on Algorithms for Sequential Decision Making under advisor Leslie P. Kaelbling ^[2] . His research interests focus on stochastic games and reinforcement learning along with the related Markov Models for decision making, such as Markov Chain, Hidden Markov Model (HMM), Markov Decision Process (MDP), and Partially Observable Markov Decision Process (POMDP).

Crossword Solver

During his time at Duke University in the late 90s, Michael L. Littman worked on an automated crossword solver Proverb ^[3] ^[4], which won an Outstanding Paper Award in 1999 from AAAI ^[5] ^[6] and competed in the American Crossword Puzzle Tournament ^[7] ^[8].

Michael Littman's explanatory grid on Markov Models ^[9] :

Markov Models		Do we have control over the state transitons?
Markov Models		NO	YES
Are the states completely observable?	YES	Markov Chain	MDP
Are the states completely observable?	NO	HMM	POMDP

Justin A. Boyan, Michael L. Littman (1993). Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach. NIPS 1993, pdf
Michael L. Littman (1994). Markov Games as a Framework for Multi-Agent Reinforcement Learning. International Conference on Machine Learning, pdf
Michael L. Littman (1996). Algorithms for Sequential Decision Making . Ph.D. thesis, Brown University, pdf
Leslie Pack Kaelbling, Michael L. Littman, Andrew W. Moore (1996). Reinforcement Learning: A Survey. JAIR, Vol. 4, pdf
Michael L. Littman (1997). Probabilistic Propositional Planning: Representations and Complexity. AAAI-1997
Michael L. Littman, Judy Goldsmith, Martin Mundhenk (1998). The Computational Complexity of Probabilistic Planning. JAIR, Vol. 9, pdf
Michael L. Littman (1999). Initial Experiments in Stochastic Satisfiability. [[Conferences#AAAI-99|AAAI-1999]
Michael L. Littman, Greg A. Keim, Noam M. Shazeer (1999). Solving Crosswords with PROVERB. AAAI-1999
Noam M. Shazeer, Michael L. Littman, Greg A. Keim (1999). Solving Crossword Puzzles as Probabilistic Constraint Satisfaction. AAAI-1999, CiteSeerX
Greg A. Keim, Noam M. Shazeer, Michael L. Littman, Sushant Agarwal, Catherine M. Cheves, Joseph Fitzgerald, Jason Grosland, Fan Jiang, Shannon Pollard, Karl Weinmeister (1999). PROVERB: The Probabilistic Cruciverbalist. AAAI-1999, pdf

@@ Line 41: / Line 41: @@
 * [[Michael L. Littman]] ('''1996'''). ''Algorithms for Sequential Decision Making'' . Ph.D. thesis, [https://en.wikipedia.org/wiki/Brown_University Brown University], [http://www.cs.rutgers.edu/~mlittman/papers/thesis-with-gammas.pdf pdf]
 * [[Mathematician#LPKaelbling|Leslie Pack Kaelbling]], [[Michael L. Littman]], [[Mathematician#AWMoore|Andrew W. Moore]] ('''1996'''). ''[http://www.cs.washington.edu/research/jair/volume4/kaelbling96a-html/rl-survey.html Reinforcement Learning: A Survey]''. [http://www.jair.org/vol/vol4.html JAIR, Vol. 4], [http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume4/kaelbling96a.pdf pdf]
-* [[Michael L. Littman]] ('''1997'''). ''Probabilistic Propositional Planning: Representations and Complexity''. [[Conferences#AAAI-97|AAAI-1997]
+* [[Michael L. Littman]] ('''1997'''). ''Probabilistic Propositional Planning: Representations and Complexity''. [[Conferences#AAAI-97|AAAI-1997]]
 * [[Michael L. Littman]], [[Mathematician#JGoldsmith|Judy Goldsmith]], [[Mathematician#MMundhenk|Martin Mundhenk]] ('''1998'''). ''The Computational Complexity of Probabilistic Planning''. [http://dblp.uni-trier.de/db/journals/jair/jair9.html#LittmanGM98 JAIR, Vol. 9], [http://arxiv.org/pdf/cs/9808101.pdf pdf]
 * [[Michael L. Littman]] ('''1999'''). ''Initial Experiments in Stochastic Satisfiability''. [[Conferences#AAAI-99|AAAI-1999]