Home * People * Dana Nau

		Dana S. Nau, an American computer scientist and Professor at the University of Maryland, College Park. His research covers Artificial Intelligence ^[1] in Planning and Game Theory ^[2]. Dana Nau discovered Pathology on certain game trees, where a deeper search does not improve the decision quality, but makes the decision more and more random. Along with Stephen J.J. Smith and Thomas A. Throop, Dana Nau developed AI planning techniques in the Bridge program Bridge Baron ^[3] ^[4].
Dana S. Nau ^[5]

Selected Publications

^[6] ^[7] ^[8]

1979

Dana S. Nau (1979). Quality of Decision Versus Depth of Search on Game Trees. Ph.D. thesis, Duke University, Advisor Alan Biermann
Dana S. Nau (1979). Preliminary results regarding quality of play versus depth of search in game playing. First Internat. Symposium on Policy Analysis and Information Systems

Dana S. Nau (1980). Pathology on game trees: A summary of results. In Proceedings of the National Conference on Artificial Intelligence (AAAI)
Dana S. Nau (1982). The last player theorem. Artificial Intelligence, Vol. 18
Dana S. Nau (1982). An investigation of the causes of pathology in games. Artificial Intelligence, Vol. 19, University of Maryland, College Park, Recommended by Judea Pearl
Dana S. Nau, Vipin Kumar, Laveen N. Kanal (1982). A General Paradigm for A.I. Search Procedures. AAAI 1982
Dana S. Nau (1983). Decision quality as a function of search depth on game trees. Journal of the ACM, Vol. 30, No. 4
Dana S. Nau (1983). On game graph structure and its influence on pathology. International Journal of Computer and Information Sciences, Vol. 12, No, 6
Dana S. Nau (1983). Pathology on game trees revisited, and an alternative to minimaxing. Artificial Intelligence, Vol. 21, Nos. 1, 2, 1983, Reprinted in Judea Pearl (ed.), Search and Heuristics, North-Holland Publishing Company, Amsterdam

Stephen J.J. Smith, Dana S. Nau, Thomas A. Throop (1992). A hierarchical approach to strategic planning with non-cooperating agents under conditions of uncertainty. Proceedings of the First International Conference on AI Planning Systems
Stephen J.J. Smith, Dana S. Nau (1993). Toward an analysis of forward pruning. Technical Report, University of Maryland, College Park
Stephen J.J. Smith, Dana S. Nau (1993). Strategic planning for imperfect-information games. Technical Report, University of Maryland, College Park
Stephen J.J. Smith, Dana S. Nau (1994). An Analysis of Forward Pruning. Proceedings AAAI 1994, pdf
Stephen J.J. Smith, Dana S. Nau, Thomas A. Throop (1996). A Planning Approach to Declarer Play in Contract Bridge. Computational Intelligence, Vol. 12
Stephen J.J. Smith, Dana S. Nau, Thomas A. Throop (1996). Total-Order Multi-Agent Task-Network Planning for Contract Bridge. AAAI/IAAI 1996
Stephen J.J. Smith, Dana S. Nau, Thomas A. Throop (1998). Success in Spades: Using AI Planning Techniques to Win the World Championship of Computer Bridge. AAAI/IAAI 1998
Stephen J.J. Smith, Dana S. Nau, Thomas A. Throop (1998). Computer Bridge: A Big Win for AI Planning. AI Magazine, Vol. 19, No. 2

Austin Parker, Dana Nau, V.S. Subrahmanian (2005). Game-Tree Search with Combinatorially Large Belief States. IJCAI 2005, pdf » KriegSpiel
Brandon Wilson, Austin Parker, Dana Nau (2009). Error Minimizing Minimax: Avoiding Search Pathology in Game Trees. pdf

Page	Date Edited
Artificial Intelligence	Apr 9, 2018
Austin Parker	Apr 25, 2017
Dana Nau	Apr 25, 2017
Depth	Feb 25, 2018
Duke University	Mar 24, 2015
Ivan Bratko	Aug 16, 2017
KriegSpiel	Sep 5, 2017
Laveen Kanal	Jun 2, 2015
Mathematician	Apr 9, 2018
Matjaž Gams	May 23, 2016
Mitja Luštrek	Jan 23, 2016
People	Feb 28, 2018
Planning	Feb 12, 2018
Pruning	Jan 1, 2018
Search Pathology	Nov 26, 2017
Search with Random Leaf Values	Apr 23, 2018
Stephen J.J. Smith	Apr 7, 2014
Thomas A. Throop	Dec 25, 2017

Up one level