Agent subset adversarial search for complex non-cooperative domains
暂无分享,去创建一个
Branislav Bosanský | Michal Pechoucek | Viliam Lisý | Roman Vaculín | V. Lisý | M. Pechoucek | B. Bosanský | R. Vaculín
[1] Branislav Bosanský,et al. Adversarial search with procedural knowledge heuristic , 2009, AAMAS.
[2] Dana S. Nau,et al. Computer Bridge - A Big Win for AI Planning , 1998, AI Mag..
[3] Christos H. Papadimitriou,et al. Computing correlated equilibria in multi-player games , 2005, STOC '05.
[4] Eithan Ephrati,et al. A heuristic technique for multi‐agent planning , 1997, Annals of Mathematics and Artificial Intelligence.
[5] Keki B. Irani,et al. An Algorithmic Solution of N-Person Games , 1986, AAAI.
[6] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[7] Alan Bundy,et al. Applying adversarial planning techniques to Go , 2001, Theor. Comput. Sci..
[8] Ronen I. Brafman,et al. From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.
[9] Nathan R. Sturtevant,et al. Prob-Maxn: Playing N-Player Games with Opponent Models , 2006, AAAI.
[10] Kenrick J. Mock. Hierarchical Heuristic Search Techniques for Empire-based Games , 2002, IC-AI.