25,161
edits
Changes
Created page with "'''Home * People * Dana Nau''' FILE:DanaNau.jpg|border|right|thumb|310px|link=http://www.cs.umd.edu/%7Enau/| Dana S. Nau <ref>[http://www.cs.umd.edu/%7En..."
'''[[Main Page|Home]] * [[People]] * Dana Nau'''
[[FILE:DanaNau.jpg|border|right|thumb|310px|link=http://www.cs.umd.edu/%7Enau/| Dana S. Nau <ref>[http://www.cs.umd.edu/%7Enau/ Dana S. Nau Homepage]</ref> ]]
'''Dana S. Nau''',<br/>
an American computer scientist and professor at the [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park].
His research interests include [[Artificial Intelligence|artificial intelligence]] in [https://en.wikipedia.org/wiki/Game_theory game theory] and [[Planning|planning]], in particular [https://en.wikipedia.org/wiki/Hierarchical_task_network HTN planning].
Dana Nau discovered and elaborated on [[Search Pathology|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'' <ref>[http://www.cs.umd.edu/%7Enau/bridge/bridge.html Bridge Baron - The 1997 world champion of computer bridge uses AI planning techniques to plan its declarer play]</ref> .
=Selected Publications=
<ref>[http://www.cs.umd.edu/%7Enau/publications.html Dana Nau’s Publications]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/n/Nau:Dana_S= dblp: Dana S. Nau]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==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
==1980 ...==
* [[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.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 18
* [[Dana S. Nau]] ('''1982'''). ''An investigation of the causes of pathology in games.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 19, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park], Recommended by [[Judea Pearl]]
* [[Dana S. Nau]], [[Vipin Kumar]], [[Laveen Kanal|Laveen N. Kanal]] ('''1982'''). ''A General Paradigm for A.I. Search Procedures''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai82.html#NauKK82 AAAI 1982]
* [[Dana S. Nau]] ('''1983'''). ''Decision quality as a function of search depth on game trees.'' [[ACM#Journal|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.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 21, Nos. 1-2, reprinted in [[Judea Pearl]] (ed.) ''Search and Heuristics''. North-Holland
* [[Dana S. Nau]], [https://dblp.uni-trier.de/pers/hd/p/Purdom_Jr=:Paul_Walton Paul W. Purdom], [[Chun-Hung Tzeng]] ('''1986, 2013'''). ''An Evaluation of Two Alternatives to Minimax''. Machine Intelligence and Pattern Recognition, Vol. 4, [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
==1990 ...==
* [[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, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park]
* [[Stephen J.J. Smith]], [[Dana S. Nau]] ('''1993'''). ''Strategic planning for imperfect-information games''. Technical Report, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park]
* [[Stephen J.J. Smith]], [[Dana S. Nau]] ('''1994'''). ''An Analysis of Forward Pruning''. Proceedings AAAI 1994, [http://www.aaai.org/Papers/AAAI/1994/AAAI94-213.pdf 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
==2000 ...==
* [https://dblp.uni-trier.de/pers/hd/c/Ciocoiu:Mihai Mihai Ciocoiu], [[Dana S. Nau]] ('''2000'''). ''Ontology-Based Semantics''. [https://dblp.uni-trier.de/db/conf/kr/kr2000.html KR 2000], [http://www.cs.umd.edu/%7Enau/papers/ciocoiu2000ontology-based.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Ontology_(information_science) Ontology (information science) from Wikipedia]</ref>
* [[Austin Parker]], [[Dana S. Nau]], [http://dblp.uni-trier.de/pers/hd/s/Subrahmanian:V=_S= V.S. Subrahmanian] ('''2005'''). ''Game-Tree Search with Combinatorially Large Belief States''. [[Conferences#IJCAI2005|IJCAI 2005]], [http://www.ijcai.org/papers/0878.pdf pdf] » [[KriegSpiel]]
* [[Brandon Wilson]], [[Austin Parker]], [[Dana S. Nau]] ('''2009'''). ''Error Minimizing Minimax: Avoiding Search Pathology in Game Trees''. [http://www.cs.umd.edu/%7Ebswilson/papers/pgamePathology.pdf pdf]
==2010 ...==
* [[Dana S. Nau]], [[Mitja Luštrek]], [[Austin Parker]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2010'''). ''When is it better not to look ahead?''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 174, No. 16–17, [http://www.cs.umd.edu/~nau/papers/nau2010when.pdf pdf], [https://dis.ijs.si/mitjal/documents/Nau-When_is_it_better_not_to_look_ahead-AIJ-10.pdf pdf preprint]
* [[Brandon Wilson]], [[Inon Zuckerman]], [[Austin Parker]], [[Dana S. Nau]] ('''2012'''). ''Improving Local Decisions in Adversarial Search''. [https://dblp.uni-trier.de/db/conf/ecai/ecai2012.html ECAI 2012], [http://www.ariel.ac.il/sites/inon/papers/ECAI12Wilson.pdf pdf]
* [[Adi Botea]], [[Bruno Bouzy]], [[Michael Buro]], [[Christian Bauckhage]], [[Dana S. Nau]] ('''2013'''). ''Pathfinding in Games''. [https://dblp.uni-trier.de/db/conf/dagstuhl/dfu6.html Artificial and Computational Intelligence in Games 2013], [http://drops.dagstuhl.de/opus/volltexte/2013/4333/pdf/4.pdf pdf]
* [[Peter Cowling]], [[Michael Buro]], [[Michal Bída]], [[Adi Botea]], [[Bruno Bouzy]], [[Martin V. Butz]], [[Philip Hingston]], [[Hector Muñoz-Avila]], [[Dana S. Nau]], [[Moshe Sipper]] ('''2013'''). ''Search in Real-Time Video Games''. [https://dblp.uni-trier.de/db/conf/dagstuhl/dfu6.html Artificial and Computational Intelligence in Games 2013], [http://drops.dagstuhl.de/opus/volltexte/2013/4332/pdf/3.pdf pdf]
* [https://dblp.uni-trier.de/pers/hd/d/De:Soham Soham De], [[Dana S. Nau]], [https://dblp.uni-trier.de/pers/hd/g/Gelfand:Michele Michele J. Gelfand] ('''2016'''). ''Using Game Theory to Study the Evolution of Cultural Norms''. [https://arxiv.org/abs/1606.02570 arXiv:1606.02570]
* [https://dblp.uni-trier.de/pers/hd/d/De:Soham Soham De], [[Dana S. Nau]], [https://dblp.uni-trier.de/pers/hd/g/Gelfand:Michele Michele J. Gelfand] ('''2017'''). ''Understanding Norm Change: An Evolutionary Game-Theoretic Approach (Extended Version)''. [https://arxiv.org/abs/1704.04720 arXiv:1704.04720]
* [[Inon Zuckerman]], [[Brandon Wilson]], [[Dana S. Nau]] ('''2018'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1111/coin.12162 Avoiding game-tree pathology in 2-player adversarial search]''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 34, No. 2
=External Links=
* [http://www.cs.umd.edu/%7Enau/ Dana S. Nau Homepage]
* [https://en.wikipedia.org/wiki/Dana_S._Nau Dana S. Nau from Wikipedia]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=75703 The Mathematics Genealogy Project - Dana S. Nau]
* Dana S. Nau at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010, [https://en.wikipedia.org/wiki/YouTube YouTube] Video » [[KriegSpiel]], [[Opponent Model Search]]
: {{#evu:https://www.youtube.com/watch?v=Epph5qKQwoA|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Nau]]
[[Category:Researcher|Nau]]
[[Category:Videos|Nau]]
[[FILE:DanaNau.jpg|border|right|thumb|310px|link=http://www.cs.umd.edu/%7Enau/| Dana S. Nau <ref>[http://www.cs.umd.edu/%7Enau/ Dana S. Nau Homepage]</ref> ]]
'''Dana S. Nau''',<br/>
an American computer scientist and professor at the [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park].
His research interests include [[Artificial Intelligence|artificial intelligence]] in [https://en.wikipedia.org/wiki/Game_theory game theory] and [[Planning|planning]], in particular [https://en.wikipedia.org/wiki/Hierarchical_task_network HTN planning].
Dana Nau discovered and elaborated on [[Search Pathology|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'' <ref>[http://www.cs.umd.edu/%7Enau/bridge/bridge.html Bridge Baron - The 1997 world champion of computer bridge uses AI planning techniques to plan its declarer play]</ref> .
=Selected Publications=
<ref>[http://www.cs.umd.edu/%7Enau/publications.html Dana Nau’s Publications]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/n/Nau:Dana_S= dblp: Dana S. Nau]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==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
==1980 ...==
* [[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.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 18
* [[Dana S. Nau]] ('''1982'''). ''An investigation of the causes of pathology in games.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 19, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park], Recommended by [[Judea Pearl]]
* [[Dana S. Nau]], [[Vipin Kumar]], [[Laveen Kanal|Laveen N. Kanal]] ('''1982'''). ''A General Paradigm for A.I. Search Procedures''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai82.html#NauKK82 AAAI 1982]
* [[Dana S. Nau]] ('''1983'''). ''Decision quality as a function of search depth on game trees.'' [[ACM#Journal|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.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 21, Nos. 1-2, reprinted in [[Judea Pearl]] (ed.) ''Search and Heuristics''. North-Holland
* [[Dana S. Nau]], [https://dblp.uni-trier.de/pers/hd/p/Purdom_Jr=:Paul_Walton Paul W. Purdom], [[Chun-Hung Tzeng]] ('''1986, 2013'''). ''An Evaluation of Two Alternatives to Minimax''. Machine Intelligence and Pattern Recognition, Vol. 4, [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
==1990 ...==
* [[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, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park]
* [[Stephen J.J. Smith]], [[Dana S. Nau]] ('''1993'''). ''Strategic planning for imperfect-information games''. Technical Report, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park]
* [[Stephen J.J. Smith]], [[Dana S. Nau]] ('''1994'''). ''An Analysis of Forward Pruning''. Proceedings AAAI 1994, [http://www.aaai.org/Papers/AAAI/1994/AAAI94-213.pdf 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
==2000 ...==
* [https://dblp.uni-trier.de/pers/hd/c/Ciocoiu:Mihai Mihai Ciocoiu], [[Dana S. Nau]] ('''2000'''). ''Ontology-Based Semantics''. [https://dblp.uni-trier.de/db/conf/kr/kr2000.html KR 2000], [http://www.cs.umd.edu/%7Enau/papers/ciocoiu2000ontology-based.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Ontology_(information_science) Ontology (information science) from Wikipedia]</ref>
* [[Austin Parker]], [[Dana S. Nau]], [http://dblp.uni-trier.de/pers/hd/s/Subrahmanian:V=_S= V.S. Subrahmanian] ('''2005'''). ''Game-Tree Search with Combinatorially Large Belief States''. [[Conferences#IJCAI2005|IJCAI 2005]], [http://www.ijcai.org/papers/0878.pdf pdf] » [[KriegSpiel]]
* [[Brandon Wilson]], [[Austin Parker]], [[Dana S. Nau]] ('''2009'''). ''Error Minimizing Minimax: Avoiding Search Pathology in Game Trees''. [http://www.cs.umd.edu/%7Ebswilson/papers/pgamePathology.pdf pdf]
==2010 ...==
* [[Dana S. Nau]], [[Mitja Luštrek]], [[Austin Parker]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2010'''). ''When is it better not to look ahead?''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 174, No. 16–17, [http://www.cs.umd.edu/~nau/papers/nau2010when.pdf pdf], [https://dis.ijs.si/mitjal/documents/Nau-When_is_it_better_not_to_look_ahead-AIJ-10.pdf pdf preprint]
* [[Brandon Wilson]], [[Inon Zuckerman]], [[Austin Parker]], [[Dana S. Nau]] ('''2012'''). ''Improving Local Decisions in Adversarial Search''. [https://dblp.uni-trier.de/db/conf/ecai/ecai2012.html ECAI 2012], [http://www.ariel.ac.il/sites/inon/papers/ECAI12Wilson.pdf pdf]
* [[Adi Botea]], [[Bruno Bouzy]], [[Michael Buro]], [[Christian Bauckhage]], [[Dana S. Nau]] ('''2013'''). ''Pathfinding in Games''. [https://dblp.uni-trier.de/db/conf/dagstuhl/dfu6.html Artificial and Computational Intelligence in Games 2013], [http://drops.dagstuhl.de/opus/volltexte/2013/4333/pdf/4.pdf pdf]
* [[Peter Cowling]], [[Michael Buro]], [[Michal Bída]], [[Adi Botea]], [[Bruno Bouzy]], [[Martin V. Butz]], [[Philip Hingston]], [[Hector Muñoz-Avila]], [[Dana S. Nau]], [[Moshe Sipper]] ('''2013'''). ''Search in Real-Time Video Games''. [https://dblp.uni-trier.de/db/conf/dagstuhl/dfu6.html Artificial and Computational Intelligence in Games 2013], [http://drops.dagstuhl.de/opus/volltexte/2013/4332/pdf/3.pdf pdf]
* [https://dblp.uni-trier.de/pers/hd/d/De:Soham Soham De], [[Dana S. Nau]], [https://dblp.uni-trier.de/pers/hd/g/Gelfand:Michele Michele J. Gelfand] ('''2016'''). ''Using Game Theory to Study the Evolution of Cultural Norms''. [https://arxiv.org/abs/1606.02570 arXiv:1606.02570]
* [https://dblp.uni-trier.de/pers/hd/d/De:Soham Soham De], [[Dana S. Nau]], [https://dblp.uni-trier.de/pers/hd/g/Gelfand:Michele Michele J. Gelfand] ('''2017'''). ''Understanding Norm Change: An Evolutionary Game-Theoretic Approach (Extended Version)''. [https://arxiv.org/abs/1704.04720 arXiv:1704.04720]
* [[Inon Zuckerman]], [[Brandon Wilson]], [[Dana S. Nau]] ('''2018'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1111/coin.12162 Avoiding game-tree pathology in 2-player adversarial search]''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 34, No. 2
=External Links=
* [http://www.cs.umd.edu/%7Enau/ Dana S. Nau Homepage]
* [https://en.wikipedia.org/wiki/Dana_S._Nau Dana S. Nau from Wikipedia]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=75703 The Mathematics Genealogy Project - Dana S. Nau]
* Dana S. Nau at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010, [https://en.wikipedia.org/wiki/YouTube YouTube] Video » [[KriegSpiel]], [[Opponent Model Search]]
: {{#evu:https://www.youtube.com/watch?v=Epph5qKQwoA|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Nau]]
[[Category:Researcher|Nau]]
[[Category:Videos|Nau]]
