Decision-Theoretic Clustering of Strategies
暂无分享,去创建一个
Michael H. Bowling | Csaba Szepesvári | Nolan Bard | Deon Nicholas | Csaba Szepesvari | Michael Bowling | Nolan Bard | D. Nicholas
[1] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[2] H. Kuhn. 9. A SIMPLIFIED TWO-PERSON POKER , 1951 .
[3] J. H. Ward. Hierarchical Grouping to Optimize an Objective Function , 1963 .
[4] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[5] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .
[6] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[7] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.
[8] U. M. Feyyad. Data mining and knowledge discovery: making sense out of data , 1996 .
[9] Jon M. Kleinberg,et al. Segmentation problems , 2004, JACM.
[10] Jon M. Kleinberg,et al. A Microeconomic View of Data Mining , 1998, Data Mining and Knowledge Discovery.
[11] Michael H. Bowling,et al. Bayes' Bluff: Opponent Modelling in Poker , 2005, UAI 2005.
[12] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[13] Shlomo Zilberstein,et al. Value-based observation compression for DEC-POMDPs , 2008, AAMAS.
[14] Craig Boutilier,et al. Social Choice : From Consensus to Personalized Decision Making , 2011 .
[15] Michael H. Bowling,et al. Online implicit agent modelling , 2013, AAMAS.