|
[1] D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, D. Szafron, “Approximating Game-Theoretic Optimal Strategies for Full-scale Poker”, IJCAI, 2003, pp.661-668. [2] D. Billings, D. Papp, J. Schaeffer, D. Szafron, “Opponent Modeling in Poker”, AAAI, 1998, pp.493-999. [3] D. Billings, D. Papp, L. Peña, J. Schaeffer, D. Szafron, “Using Selective- Sampling Simulations in Poker”, AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, AAAI Press. Technical Report SS-99-06, 1999, pp. 13-18. [4] D. Billings, L. Peña, J. Schaeffer, D. Szafron, “Using probabilistic knowledge and simulation to play poker”, AAAI, 1999, pp. 697-703. [5] E. Borel, “La théorie du jeux et les équations intégrales à noyau symétriques”, C. R. Math. Acad. Sci. Paris, 1921, Vol.173, pp.1304-1308. [6] E. Borel, “Le jeu de poker”, Applications aux Jeux des Hazard, Chapter 5, 1938. [7] A.M Brandenburger, B. J. Nalebuff, “The Right Game: Use Game Theory to Shape Strategy,” Journal of Harvard Business Review, 1995, Vol.73, No.4, pp.57-71. [8] T. S. Ferguson, Game Theory, Part II, Class notes for Math 167, Fall 2000. [9] G. Kendall, M. Willdig, “An Investigation of an Adaptive Poker Player”, In Proc. 14th Australian J.Conf. Artificial Intelligence, Adelaide, Australia, 2001, pp.189-200. [10] D. Koller, N. Megiddo, “The Complexity of Two-Person Zero-Sum Games in Extensive Form”, Games and Economic Behavior, 1992, Vol.4, pp.528-552. [11] D. Koller, N. Megiddo, B. v. Stengel, “Efficient solutions of extensive two-person games”, Games and Economic Behavior, 1996, Vol.14, pp.247-259. [12] D. Koller, N. Megiddo, B. v. Stengel, “Fast algorithms for finding randomized strategies in game trees”, In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp.750-759. [13] D. Koller, A. Pfeffer, “Representations and solutions for game-theoretic problems”, Artificial Intelligence, 1997, Vol.94, No.1, pp.167-215. [14] K. B. Korb, A. E. Nicholson, N. Jitnah, “Bayesian poker”, In proceedings of 15th Conference on Uncertainty in Articial Intelligence, 1999, pp. 343-350. [15] H. W. Kuhn, “A simplified two-person poker”, Contributions to the Theory of Games I, Princeton University Press, 1950, pp.97-103. [16] H. W. Kuhn, “Extensive games and the problem of information”, in Contributions to the Theory of games II, Princeton Univ. Press, 1953, pp.193-216. [17] J. F. Nash, “Equilibrium points in N-person Games”, Proc. Nat. Acad. Sc. 36, 1950, pp.48-49. [18] J. v. Neumann, “Zur Theorie der Gesellschaftsspiele”, Math. Ann., 1928, Vol.100, pp.295-320. [19] J. v. Neumann, O. Morgenstern, The Theory of Games and Economic Behavior. Princeton University Press, 1944. [20] J. -P. Ponssard, S. Sylvain, “The LP formulation of finite zero sum games with incomplete information”, International Journal of Game Theory, 1980, Vol. 9, pp. 99-105. [21] M. Salim, P. Rohwer, “Poker Opponent Modeling”, http://www.cs.indiana.edu/~msalim/research/ [22] Terence Conrad Schauenberg, “Opponent Modelling and Search in Poker”, M.Sc. thesis, 2006. [23] D. Sklansky, “The Theory of Poker”, Two Plus Two Publishing, fourth edith, 1989. [24] D. Sklansky, M. Malmuth, “Hold'Em Poker for Advanced Players”, Two Plus Two Publishing, 3rd edition, 1999. [25] D. Snidal, “Game Theory of International Politics,” in Kenneth Oye, eds. Cooperation under Anarchy, 1986, pp. 25-57. [26] F. Southey, M. Bowling, B. Larson, C. Piccione, N. Burch, D. Billings, C. Rayner, “Bayes' Bluff: Opponent Modelling in Poker”, in 21st Conference on Uncertainty in Artificial Intelligence (UAI-2005), 2005, pp.550-558. [27] E. Zermelo, “Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels”, In Proceedings of the Fifth InternationalCongress of Mathe- maticians II, Cambridge University Press, 1913, pp.501–504.
|