25,161
edits
Changes
Created page with "'''Home * People * Michael L. Littman''' FILE:Michael Littman at Rutgers 2009.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/Michael_L._Littman..."
'''[[Main Page|Home]] * [[People]] * Michael L. Littman'''
[[FILE:Michael Littman at Rutgers 2009.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/Michael_L._Littman| Michael L. Littman <ref>Michael Littman at [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University] in 2009. This picture was taken by a student during a lecture, [https://en.wikipedia.org/wiki/Michael_L._Littman Michael L. Littman from Wikipedia]</ref> ]]
'''Michael Lederman Littman''',<br/>
an American mathematician, computer scientist and professor of CS at [https://en.wikipedia.org/wiki/Brown_University Brown University], and before at [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University] and [[Duke University]]. He received his Ph.D. in 1996 at Brown University on ''Algorithms for Sequential Decision Making'' under advisor [[Mathematician#LPKaelbling|Leslie P. Kaelbling]] <ref>[[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]</ref> . His research interests focus on [https://en.wikipedia.org/wiki/Stochastic_game stochastic games] and [[Reinforcement Learning|reinforcement learning]] along with the related [https://en.wikipedia.org/wiki/Markov_model Markov Models] for [https://en.wikipedia.org/wiki/Decision-making decision making], such as [https://en.wikipedia.org/wiki/Markov_chain Markov Chain], [https://en.wikipedia.org/wiki/Hidden_Markov_model Hidden Markov Model] (HMM), [https://en.wikipedia.org/wiki/Markov_decision_process Markov Decision Process] (MDP), and [https://en.wikipedia.org/wiki/Partially_observable_Markov_decision_process Partially Observable Markov Decision Process] (POMDP).
=Crossword Solver=
<span id="Proverb"></span>During his time at [[Duke University]] in the late 90s, Michael L. Littman worked on an automated [https://en.wikipedia.org/wiki/Crossword crossword] solver '''Proverb''' <ref>[http://www.oneacross.com/proverb/ Proverb: The Probabilistic Cruciverbalist]</ref> <ref>[https://en.wikipedia.org/wiki/Proverb_%28disambiguation%29 Proverb (disambiguation) from Wikipedia]</ref>, which won an Outstanding Paper Award in 1999 from [[AAAI]] <ref>[http://www.aaai.org/Awards/paper.php AAAI Outstanding Paper Award:]</ref> <ref>[https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer], [[Michael L. Littman]], [http://dblp.uni-trier.de/pers/hd/a/Agarwal:Sushant Sushant Agarwal], [http://dblp.uni-trier.de/pers/hd/c/Cheves:Catherine_M= Catherine M. Cheves], [http://dblp.uni-trier.de/pers/hd/f/Fitzgerald:Joseph Joseph Fitzgerald], [http://dblp.uni-trier.de/pers/hd/g/Grosland:Jason Jason Grosland], [http://dblp.uni-trier.de/pers/hd/j/Jiang:Fan Fan Jiang], [http://dblp.uni-trier.de/pers/hd/p/Pollard:Shannon Shannon Pollard], [http://dblp.uni-trier.de/pers/hd/w/Weinmeister:Karl Karl Weinmeister] ('''1999'''). ''PROVERB: The Probabilistic Cruciverbalist''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#ShazeerLK99 AAAI/IAAI 1999], [http://www.cs.columbia.edu/~kathy/cs4701/documents/Proverb.pdf pdf]</ref> and competed in the [https://en.wikipedia.org/wiki/American_Crossword_Puzzle_Tournament American Crossword Puzzle Tournament] <ref>[http://www.crosswordtournament.com/1999/art4.htm Proverb, the Crossword-Solving Computer Program]</ref> <ref>[https://en.wikipedia.org/wiki/Michael_L._Littman Michael L. Littman from Wikipedia]</ref>.
=See also=
* [[Matthew L. Ginsberg#DRFill|Dr.Fill]] by [[Matthew L. Ginsberg]]
<span id="MarkovModels"></span>
=Markov Models=
Michael Littman's explanatory grid on [https://en.wikipedia.org/wiki/Markov_model Markov Models] <ref>[http://www.pomdp.org/faq.shtml The POMDP Page] by [[Anthony R. Cassandra]]</ref> :
{| class="wikitable" style="text-align:center;"
|-
| colspan="2" rowspan="2" | [[Mathematician#Markov|Markov]]<br/>[https://en.wikipedia.org/wiki/Markov_model Models]
| colspan="2" | Do we have control<br/>over the state transitons?
|-
| '''NO'''
| '''YES'''
|-
| rowspan="2" | Are the states<br/>completely observable?
| '''YES'''
| [https://en.wikipedia.org/wiki/Markov_chain Markov Chain]
| [https://en.wikipedia.org/wiki/Markov_decision_process MDP]
|-
| '''NO'''
| [https://en.wikipedia.org/wiki/Hidden_Markov_model HMM]
| [https://en.wikipedia.org/wiki/Partially_observable_Markov_decision_process POMDP]
|}
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/l/Littman:Michael_L= dblp: Michael L. Littman]</ref>
==1990 ...==
* [[Justin A. Boyan]], [[Michael L. Littman]] ('''1993'''). ''Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach''. [https://papers.nips.cc/book/advances-in-neural-information-processing-systems-6-1993 NIPS 1993], [https://www.cs.cmu.edu/~jab/cv/pubs/boyan.q-routing.pdf pdf]
* [[Michael L. Littman]] ('''1994'''). ''Markov Games as a Framework for Multi-Agent Reinforcement Learning''. International Conference on Machine Learning, [http://www.cs.duke.edu/courses/spring07/cps296.3/littman94markov.pdf pdf]
* [[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''. [http://dblp.uni-trier.de/db/conf/aaai/aaai97.html#Littman97 AAAI/IAAI 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''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#Littman99 AAAI/IAAI 1999]
* [[Michael L. Littman]], [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer] ('''1999'''). ''Solving Crosswords with PROVERB''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#LittmanKS99 AAAI/IAAI 1999]
* [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer], [[Michael L. Littman]], [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim] ('''1999'''). ''Solving Crossword Puzzles as Probabilistic Constraint Satisfaction''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#ShazeerLK99 AAAI/IAAI 1999], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9001 CiteSeerX]
* [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer], [[Michael L. Littman]], [http://dblp.uni-trier.de/pers/hd/a/Agarwal:Sushant Sushant Agarwal], [http://dblp.uni-trier.de/pers/hd/c/Cheves:Catherine_M= Catherine M. Cheves], [http://dblp.uni-trier.de/pers/hd/f/Fitzgerald:Joseph Joseph Fitzgerald], [http://dblp.uni-trier.de/pers/hd/g/Grosland:Jason Jason Grosland], [http://dblp.uni-trier.de/pers/hd/j/Jiang:Fan Fan Jiang], [http://dblp.uni-trier.de/pers/hd/p/Pollard:Shannon Shannon Pollard], [http://dblp.uni-trier.de/pers/hd/w/Weinmeister:Karl Karl Weinmeister] ('''1999'''). ''PROVERB: The Probabilistic Cruciverbalist''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#ShazeerLK99 AAAI/IAAI 1999], [http://www.cs.columbia.edu/~kathy/cs4701/documents/Proverb.pdf pdf]
==2000 ...==
* [[Sebastian Thrun]], [[Michael L. Littman]] ('''2000'''). ''A Review of Reinforcement Learning''. [http://www.informatik.uni-trier.de/~ley/db/journals/aim/aim21.html#ThrunL00 AI Magazine, Vol. 21], No. 1, [http://www.aistudy.com/paper/aaai_journal/AIMag21-01-001.pdf pdf]
* [[Michael L. Littman]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-45579-5_26 Review: Computer Language Games]''. [[CG 2000]]
* [[Jiefu Shi]], [[Michael L. Littman]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-45579-5_22 Abstraction Methods for Game Theoretic Poker]''. [[CG 2000]]
* [[Michael L. Littman]], [[Richard Sutton]], [[Mathematician#SSingh|Satinder Singh]] ('''2001'''). ''Predictive Representations of State''. [http://dblp.uni-trier.de/db/conf/nips/nips2001.html#LittmanSS01 NIPS 2001], [http://web.eecs.umich.edu/~baveja/Papers/psr.pdf pdf]
* [[Michael L. Littman]] ('''2001'''). ''Value-function reinforcement learning in Markov games''. [http://dblp.uni-trier.de/db/journals/cogsr/cogsr2.html#Littman01 Cognitive Systems Research, Vol. 2], [http://www.cogsci.rpi.edu/~rsun/si-mal/article3.pdf pdf]
* [[Michael L. Littman]], [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer] ('''2002'''). ''A probabilistic approach to solving crossword puzzles''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 134, [http://www.oneacross.com/proverb/papers/aij02-proverb.pdf pdf]
* [[Peter Stone]], [[Robert Schapire]], [[Michael L. Littman]], [[Mathematician#JACsirik|János A. Csirik]], [[David McAllester]] ('''2003'''). ''[http://www.jair.org/papers/paper1200.html Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions]''. [http://www.jair.org/vol/vol19.html JAIR, Vol. 19], [https://www.jair.org/media/1200/live-1200-2212-jair.pdf pdf]
* [[Michael L. Littman]] ('''2008'''). ''[http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4634945&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4634945 Autonomous Model Learning for Reinforcement Learning]''. [http://dblp.uni-trier.de/db/conf/qest/qest2008.html#Littman08 QEST 2008]
==2010 ...==
* [[Thomas J. Walsh]], [[Sergiu Goschin]], [[Michael L. Littman]] ('''2010'''). ''Integrating sample-based planning and model-based reinforcement learning.'' [[AAAI]], [https://pdfs.semanticscholar.org/bdc9/bfb6ecc6fb5afb684df03d7220c46ebdbf4e.pdf pdf] » [[Monte-Carlo Tree Search|MCTS]], [[UCT]], [[Reinforcement Learning]]
* [[Michael L. Littman]] ('''2012'''). ''Technical Perspective: A New Way to Search Game Trees''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3
* [[Mathematician#MKearns|Michael Kearns]], [[Michael L. Littman]], [[Mathematician#SSingh|Satinder Singh]] ('''2013'''). ''Graphical Models for Game Theory''. [http://dblp.uni-trier.de/db/journals/corr/corr1301.html#abs-1301-2281 CoRR, January 2013], [https://www.cis.upenn.edu/~mkearns/papers/graphgames.pdf pdf]
* [[Anthony R. Cassandra]], [[Michael L. Littman]], [[Nevin L. Zhang]] ('''2013'''). ''Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes''. [http://dblp.uni-trier.de/db/journals/corr/corr1302.html#abs-1302-1525 CoRR, February 2013], [http://arxiv.org/ftp/arxiv/papers/1302/1302.1525.pdf pdf]
* [[Ari Weinstein]], [[Michael L. Littman]], [[Sergiu Goschin]] ('''2013'''). ''[http://proceedings.mlr.press/v24/weinstein12a.html Rollout-based Game-tree Search Outprunes Traditional Alpha-beta]''. [http://proceedings.mlr.press/ PMLR], Vol. 24 » [[Monte-Carlo Tree Search|MCTS]], [[UCT]]
=External Links=
* [http://cs.brown.edu/~mlittman/ Michael Littman's Home Page]
* [https://en.wikipedia.org/wiki/Michael_L._Littman Michael L. Littman from Wikipedia]
* [https://www.genealogy.ams.org/id.php?id=91913 The Mathematics Genealogy Project - Michael Littman]
=References=
<references />
'''[[People|Up one Level]]'''
[[FILE:Michael Littman at Rutgers 2009.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/Michael_L._Littman| Michael L. Littman <ref>Michael Littman at [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University] in 2009. This picture was taken by a student during a lecture, [https://en.wikipedia.org/wiki/Michael_L._Littman Michael L. Littman from Wikipedia]</ref> ]]
'''Michael Lederman Littman''',<br/>
an American mathematician, computer scientist and professor of CS at [https://en.wikipedia.org/wiki/Brown_University Brown University], and before at [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University] and [[Duke University]]. He received his Ph.D. in 1996 at Brown University on ''Algorithms for Sequential Decision Making'' under advisor [[Mathematician#LPKaelbling|Leslie P. Kaelbling]] <ref>[[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]</ref> . His research interests focus on [https://en.wikipedia.org/wiki/Stochastic_game stochastic games] and [[Reinforcement Learning|reinforcement learning]] along with the related [https://en.wikipedia.org/wiki/Markov_model Markov Models] for [https://en.wikipedia.org/wiki/Decision-making decision making], such as [https://en.wikipedia.org/wiki/Markov_chain Markov Chain], [https://en.wikipedia.org/wiki/Hidden_Markov_model Hidden Markov Model] (HMM), [https://en.wikipedia.org/wiki/Markov_decision_process Markov Decision Process] (MDP), and [https://en.wikipedia.org/wiki/Partially_observable_Markov_decision_process Partially Observable Markov Decision Process] (POMDP).
=Crossword Solver=
<span id="Proverb"></span>During his time at [[Duke University]] in the late 90s, Michael L. Littman worked on an automated [https://en.wikipedia.org/wiki/Crossword crossword] solver '''Proverb''' <ref>[http://www.oneacross.com/proverb/ Proverb: The Probabilistic Cruciverbalist]</ref> <ref>[https://en.wikipedia.org/wiki/Proverb_%28disambiguation%29 Proverb (disambiguation) from Wikipedia]</ref>, which won an Outstanding Paper Award in 1999 from [[AAAI]] <ref>[http://www.aaai.org/Awards/paper.php AAAI Outstanding Paper Award:]</ref> <ref>[https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer], [[Michael L. Littman]], [http://dblp.uni-trier.de/pers/hd/a/Agarwal:Sushant Sushant Agarwal], [http://dblp.uni-trier.de/pers/hd/c/Cheves:Catherine_M= Catherine M. Cheves], [http://dblp.uni-trier.de/pers/hd/f/Fitzgerald:Joseph Joseph Fitzgerald], [http://dblp.uni-trier.de/pers/hd/g/Grosland:Jason Jason Grosland], [http://dblp.uni-trier.de/pers/hd/j/Jiang:Fan Fan Jiang], [http://dblp.uni-trier.de/pers/hd/p/Pollard:Shannon Shannon Pollard], [http://dblp.uni-trier.de/pers/hd/w/Weinmeister:Karl Karl Weinmeister] ('''1999'''). ''PROVERB: The Probabilistic Cruciverbalist''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#ShazeerLK99 AAAI/IAAI 1999], [http://www.cs.columbia.edu/~kathy/cs4701/documents/Proverb.pdf pdf]</ref> and competed in the [https://en.wikipedia.org/wiki/American_Crossword_Puzzle_Tournament American Crossword Puzzle Tournament] <ref>[http://www.crosswordtournament.com/1999/art4.htm Proverb, the Crossword-Solving Computer Program]</ref> <ref>[https://en.wikipedia.org/wiki/Michael_L._Littman Michael L. Littman from Wikipedia]</ref>.
=See also=
* [[Matthew L. Ginsberg#DRFill|Dr.Fill]] by [[Matthew L. Ginsberg]]
<span id="MarkovModels"></span>
=Markov Models=
Michael Littman's explanatory grid on [https://en.wikipedia.org/wiki/Markov_model Markov Models] <ref>[http://www.pomdp.org/faq.shtml The POMDP Page] by [[Anthony R. Cassandra]]</ref> :
{| class="wikitable" style="text-align:center;"
|-
| colspan="2" rowspan="2" | [[Mathematician#Markov|Markov]]<br/>[https://en.wikipedia.org/wiki/Markov_model Models]
| colspan="2" | Do we have control<br/>over the state transitons?
|-
| '''NO'''
| '''YES'''
|-
| rowspan="2" | Are the states<br/>completely observable?
| '''YES'''
| [https://en.wikipedia.org/wiki/Markov_chain Markov Chain]
| [https://en.wikipedia.org/wiki/Markov_decision_process MDP]
|-
| '''NO'''
| [https://en.wikipedia.org/wiki/Hidden_Markov_model HMM]
| [https://en.wikipedia.org/wiki/Partially_observable_Markov_decision_process POMDP]
|}
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/l/Littman:Michael_L= dblp: Michael L. Littman]</ref>
==1990 ...==
* [[Justin A. Boyan]], [[Michael L. Littman]] ('''1993'''). ''Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach''. [https://papers.nips.cc/book/advances-in-neural-information-processing-systems-6-1993 NIPS 1993], [https://www.cs.cmu.edu/~jab/cv/pubs/boyan.q-routing.pdf pdf]
* [[Michael L. Littman]] ('''1994'''). ''Markov Games as a Framework for Multi-Agent Reinforcement Learning''. International Conference on Machine Learning, [http://www.cs.duke.edu/courses/spring07/cps296.3/littman94markov.pdf pdf]
* [[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''. [http://dblp.uni-trier.de/db/conf/aaai/aaai97.html#Littman97 AAAI/IAAI 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''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#Littman99 AAAI/IAAI 1999]
* [[Michael L. Littman]], [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer] ('''1999'''). ''Solving Crosswords with PROVERB''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#LittmanKS99 AAAI/IAAI 1999]
* [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer], [[Michael L. Littman]], [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim] ('''1999'''). ''Solving Crossword Puzzles as Probabilistic Constraint Satisfaction''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#ShazeerLK99 AAAI/IAAI 1999], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9001 CiteSeerX]
* [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer], [[Michael L. Littman]], [http://dblp.uni-trier.de/pers/hd/a/Agarwal:Sushant Sushant Agarwal], [http://dblp.uni-trier.de/pers/hd/c/Cheves:Catherine_M= Catherine M. Cheves], [http://dblp.uni-trier.de/pers/hd/f/Fitzgerald:Joseph Joseph Fitzgerald], [http://dblp.uni-trier.de/pers/hd/g/Grosland:Jason Jason Grosland], [http://dblp.uni-trier.de/pers/hd/j/Jiang:Fan Fan Jiang], [http://dblp.uni-trier.de/pers/hd/p/Pollard:Shannon Shannon Pollard], [http://dblp.uni-trier.de/pers/hd/w/Weinmeister:Karl Karl Weinmeister] ('''1999'''). ''PROVERB: The Probabilistic Cruciverbalist''. [http://dblp.uni-trier.de/db/conf/aaai/aaai99.html#ShazeerLK99 AAAI/IAAI 1999], [http://www.cs.columbia.edu/~kathy/cs4701/documents/Proverb.pdf pdf]
==2000 ...==
* [[Sebastian Thrun]], [[Michael L. Littman]] ('''2000'''). ''A Review of Reinforcement Learning''. [http://www.informatik.uni-trier.de/~ley/db/journals/aim/aim21.html#ThrunL00 AI Magazine, Vol. 21], No. 1, [http://www.aistudy.com/paper/aaai_journal/AIMag21-01-001.pdf pdf]
* [[Michael L. Littman]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-45579-5_26 Review: Computer Language Games]''. [[CG 2000]]
* [[Jiefu Shi]], [[Michael L. Littman]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-45579-5_22 Abstraction Methods for Game Theoretic Poker]''. [[CG 2000]]
* [[Michael L. Littman]], [[Richard Sutton]], [[Mathematician#SSingh|Satinder Singh]] ('''2001'''). ''Predictive Representations of State''. [http://dblp.uni-trier.de/db/conf/nips/nips2001.html#LittmanSS01 NIPS 2001], [http://web.eecs.umich.edu/~baveja/Papers/psr.pdf pdf]
* [[Michael L. Littman]] ('''2001'''). ''Value-function reinforcement learning in Markov games''. [http://dblp.uni-trier.de/db/journals/cogsr/cogsr2.html#Littman01 Cognitive Systems Research, Vol. 2], [http://www.cogsci.rpi.edu/~rsun/si-mal/article3.pdf pdf]
* [[Michael L. Littman]], [https://www.linkedin.com/pub/greg-keim/0/960/648 Greg A. Keim], [http://dblp.uni-trier.de/pers/hd/s/Shazeer:Noam_M= Noam M. Shazeer] ('''2002'''). ''A probabilistic approach to solving crossword puzzles''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 134, [http://www.oneacross.com/proverb/papers/aij02-proverb.pdf pdf]
* [[Peter Stone]], [[Robert Schapire]], [[Michael L. Littman]], [[Mathematician#JACsirik|János A. Csirik]], [[David McAllester]] ('''2003'''). ''[http://www.jair.org/papers/paper1200.html Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions]''. [http://www.jair.org/vol/vol19.html JAIR, Vol. 19], [https://www.jair.org/media/1200/live-1200-2212-jair.pdf pdf]
* [[Michael L. Littman]] ('''2008'''). ''[http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4634945&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4634945 Autonomous Model Learning for Reinforcement Learning]''. [http://dblp.uni-trier.de/db/conf/qest/qest2008.html#Littman08 QEST 2008]
==2010 ...==
* [[Thomas J. Walsh]], [[Sergiu Goschin]], [[Michael L. Littman]] ('''2010'''). ''Integrating sample-based planning and model-based reinforcement learning.'' [[AAAI]], [https://pdfs.semanticscholar.org/bdc9/bfb6ecc6fb5afb684df03d7220c46ebdbf4e.pdf pdf] » [[Monte-Carlo Tree Search|MCTS]], [[UCT]], [[Reinforcement Learning]]
* [[Michael L. Littman]] ('''2012'''). ''Technical Perspective: A New Way to Search Game Trees''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3
* [[Mathematician#MKearns|Michael Kearns]], [[Michael L. Littman]], [[Mathematician#SSingh|Satinder Singh]] ('''2013'''). ''Graphical Models for Game Theory''. [http://dblp.uni-trier.de/db/journals/corr/corr1301.html#abs-1301-2281 CoRR, January 2013], [https://www.cis.upenn.edu/~mkearns/papers/graphgames.pdf pdf]
* [[Anthony R. Cassandra]], [[Michael L. Littman]], [[Nevin L. Zhang]] ('''2013'''). ''Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes''. [http://dblp.uni-trier.de/db/journals/corr/corr1302.html#abs-1302-1525 CoRR, February 2013], [http://arxiv.org/ftp/arxiv/papers/1302/1302.1525.pdf pdf]
* [[Ari Weinstein]], [[Michael L. Littman]], [[Sergiu Goschin]] ('''2013'''). ''[http://proceedings.mlr.press/v24/weinstein12a.html Rollout-based Game-tree Search Outprunes Traditional Alpha-beta]''. [http://proceedings.mlr.press/ PMLR], Vol. 24 » [[Monte-Carlo Tree Search|MCTS]], [[UCT]]
=External Links=
* [http://cs.brown.edu/~mlittman/ Michael Littman's Home Page]
* [https://en.wikipedia.org/wiki/Michael_L._Littman Michael L. Littman from Wikipedia]
* [https://www.genealogy.ams.org/id.php?id=91913 The Mathematics Genealogy Project - Michael Littman]
=References=
<references />
'''[[People|Up one Level]]'''
