25,161
edits
Changes
no edit summary
==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]]
* [[Thomas J. Walsh]], [[István Szita]], [[Carlos Diuk]], [[Michael L. Littman]] ('''2012'''). ''Exploring compact reinforcement-learning representations with linear regression''. [https://arxiv.org/abs/1205.2606 arXiv:1205.2606]
* [[Michael L. Littman]], [https://dblp.uni-trier.de/pers/hd/r/Ravi:Nishkam Nishkam Ravi], [https://dblp.uni-trier.de/pers/hd/t/Talwar:Arjun Arjun Talwar], [[Martin Zinkevich]] ('''2012'''). ''An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees''. [https://arxiv.org/abs/1206.6855 arXiv:1206.6855]
* [[Michael L. Littman]] ('''2012'''). ''Technical Perspective: A New Way to Search Game Trees''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3
* [[Ari Weinstein]], [[Michael L. Littman]] ('''2012'''). ''[https://www.aaai.org/ocs/index.php/ICAPS/ICAPS12/paper/view/4697 Bandit-Based Planning and Learning in Continuous-Action Markov Decision Processes]''. [http://dblp.uni-trier.de/db/conf/aips/icaps2012.html ICAPS 2012]
* [[Mathematician#MKearns|Michael Kearns]], [[Michael L. Littman]], [[Mathematician#SSingh|Satinder Singh]] ('''2013'''). ''Graphical Models for Game Theory''. [httphttps://dblparxiv.uni-trier.deorg/dbabs/journals/corr/corr13011301.html#abs-1301-2281 CoRR, January 2013], [httpsarXiv://www1301.cis.upenn.edu/~mkearns/papers/graphgames.pdf pdf2281]* [[Anthony R. Cassandra]], [[Michael L. Littman]], [[Nevin L. Zhang]] ('''2013'''). ''Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes''. [httphttps://dblparxiv.uni-trier.deorg/dbabs/journals/corr/corr13021302.html#abs-1302-1525 CoRR, February 2013], [httparXiv://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]]
* [[Sergiu Goschin]], [[Ari Weinstein]], [[Michael L. Littman]] ('''2013'''). ''The Cross-Entropy Method Optimizes for Quantiles''. [http://dblp.uni-trier.de/db/conf/icml/icml2013.html ICML 2013]
* [[Ari Weinstein]], [[Michael L. Littman]] ('''2013'''). ''Open-Loop Planning in Large-Scale Stochastic Domains''. [[Conferences#AAAI-2013|AAAI-2013]]
* [https://dblp.uni-trier.de/pers/hd/a/Asadi:Kavosh Kavosh Asadi], [[Michael L. Littman]] ('''2016'''). ''An Alternative Softmax Operator for Reinforcement Learning''. [https://arxiv.org/abs/1612.05628 arXiv:1612.05628]
* [https://dblp.uni-trier.de/pers/hd/l/Lehnert:Lucas Lucas Lehnert], [[Michael L. Littman]] ('''2018'''). ''Transfer with Model Features in Reinforcement Learning''. [https://arxiv.org/abs/1807.01736 arXiv:1807.01736]
=External Links=
'''[[People|Up one Level]]'''
[[Category:Researcher|Littman]]
