K. Korb, A. Nicholson, N. Jitnah, Bayesian poker, in: Proc. 15th Conf. on Uncertainty in Artificial Intelligence, Stockholm, Sweden, 1999, pp. 343--350.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....problems ( 26] for example) Another way to reduce the complexity of the problem is to look at a subset of the game, and try to address each sub problem in isolation. Several attempts have been made to apply machine learning techniques to a particular aspect of poker (some examples include [9, 20, 34, 39]) Similarly, many studies only look at two player poker games. Multi player games are vastly more complicated, even with the usual assumption of no co operative behavior between players. The danger with any type of simpli cation is that it can destroy the most challenging and interesting aspects ....

K. Korb and A. Nicholson. Bayesian poker. In Uncertainty in Articial Intelligence, pages 343-350, 1999.

.... diagnosis and prediction systems [Arroyo Figueroa and Sucar 1999; van der Gaag et al. 1999] requirements engineering [Barry and Laskey 1999] intelligent buildings [Boman et al. 1999] auctions [Boutilier et al. 1999] intelligent email handling and receiver alerting [Horvitz et al. 1999] poker [Korb et al. 1999]; educational assessment [Mislevy et al. 1999] video advising (choosing the right video to watch tonight) Nguyen and Haddawy 1999] dependability analysis [Portinale and Bobbio 1999] robot location [Shatkay 1999] and waste management [Welch and Smoth 1999] We apologize to any authors from ....

Korb, K. B., Nicholson, A. E., and Jitnah, N. 1999. Bayesian poker. In Proc. 15th Conference on Uncertainty in Artificial Intelligence (1999). Morgan Kaufman.

.... diagnosis and prediction systems [Arroyo Figueroa and Sucar 1999; van der Gaag et al. 1999] requirements engineering [Barry and Laskey 1999] intelligent buildings [Boman et al. 1999] auctions [Boutilier et al. 1999] intelligent email handling and receiver alerting [Horvitz et al. 1999] poker [Korb et al. 1999]; educational assessment [Mislevy et al. 1999] video advising (choosing the right video to watch tonight) Nguyen and Haddawy 1999] dependability analysis [Portinale and Bobbio 1999] robot location [Shatkay 1999] and waste management [Welch and Smoth 1999] We apologize to any authors from ....

Korb, K. B., Nicholson, A. E., and Jitnah, N. 1999. Bayesian poker. In Proc. 15th Conference on Uncertainty in Articial Intelligence (1999). Morgan Kaufman.

....number of invisible pieces, i.e. pieces that a player s opponent cannot see, and is thus a representative of the general class of strategically complex, imperfect information, two player, zero sum games. Many researchers have investigated games with missing information including poker ( 7] [14], 13] bridge ( 10] 12] 21] and multi user domains [1] With the exception of Albrecht et al. 1] who use a large uncontrollable domain, all of these domains are strategically simple given perfect information. Invisible chess retains the strategic complexity of standard chess with the ....

K B Korb, A E Nicholson, and N Jitnah. Bayesian poker. In K B Laskey and H Prade, editors, Proc. of the 15th Conf. on Uncertainty in AI, pages 343--350, Stockholm, Sweden, August 1999. Morgan Kaufmann.

No context found.

K. Korb, A. Nicholson, N. Jitnah, Bayesian poker, in: Proc. 15th Conf. on Uncertainty in Artificial Intelligence, Stockholm, Sweden, 1999, pp. 343--350.

No context found.

K. Korb and A. Nicholson. Bayesian poker. In Uncertainty in Arti cial Intelligence, pages 343-350, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC