M. Sakaguchi and S. Sakai. Solutions of some three-person stud and draw poker. Mathematics Japonica, pages 1147--1160, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Approximating Game-Theoretic Optimal Strategies for.. - Billings Burch Davidson (2003) (7 citations) (Correct)
....poker, specifically Texas Hold em, the most popular form of casino poker and the poker variant used to determine the world champion at the annual World Series of Poker. Due to the computational limitations involved, only simplified poker variations have been solved in the past (e.g. Kuhn, 1950; Sakaguchi and Sakai, 1992 ] While these are of theoretical interest, the same methods are not feasible for real games, which are too large by many orders of magnitude ( Koller and Pfeffer, 1997 ] Shi and Littman, 2001] investigated abstraction techniques to reduce the large search space and complexity of the problem, ....
M. Sakaguchi and S. Sakai. Solutions of some three-person stud and draw poker. Mathematics Japonica, pages 1147--1160, 1992.
The Challenge of Poker - Billings, Davidson, Schaeffer.. (2001) (7 citations) (Correct)
....sucient to demonstrate certain fundamental principles of game theory, it bears little resemblance to normal competitive poker variations. Mathematicians have also explored many interesting problems related to poker, and highly simpli ed variations are again sucient to provide complex 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] ....
M. Sakaguchi and S. Sakai. Solutions of some three-person stud and draw poker. Mathematics Japonica, 6(37):1147-1160, 1992.
Evolving Computer Opponents to Play a Game of Simplified Poker - Barone, While (1998) (1 citation) (Correct)
....applying game theory to poker was conducted by von Neumann and Morgenstern in the 1940s[16] Using a very simpli ed game of poker, one of their most important conclusions was the need for blung for competent play. Some attempts were made to adapt this approach to more realistic games of poker[1] [11], but with only limited success. Common failings of these game theoretical approaches include their inadequate handling of several fundamental poker principles (e.g. betting position) and the diculty of applying them to di erent poker variants. A model with a dynamic learning ability would be ....
M. Sakaguchi and S. Sakai. Solutions of some three person stud and draw poker. Math Japonica 37, pages 1147-1160, 1992.
An Adaptive Learning Model for Simplified Poker Using.. - Barone, While (1999) (2 citations) (Correct)
....applying game theory to poker was conducted by von Neumann and Morgenstern in the 1940s [19] Using a very simplified game of poker, one of their most important conclusions was the need for bluffing for competent play. Some attempts were made to adapt this approach to more realistic games of poker [1, 14], but with only limited success. Common failings of these game theoretical approaches include their inadequate handling of several fundamental poker principles (e.g. betting position) and the difficulty of applying them to different poker variants. A model with a dynamic learning ability should be ....
M. Sakaguchi and S. Sakai. Solutions of some three person stud and draw poker. Math Japonica 37, pages 1147--1160, 1992.
Learning to Play Strong Poker - Schaeffer, Billings, Peņa, Szafron (1999) (1 citation) (Correct)
....potential research benefits. Poker has a rich history of scientific investigation. Economists and mathematicians have applied a variety of analytical techniques to certain poker related problems. However, since real poker is too complex for this approach, they have studied simplified variants ([15] for example) Other individuals, including expert players with a penchant for mathematics, have gained considerable insight about real poker by using partial mathematical analyses, simulation, and ad hoc expert experience ( 18] is a popular example) Until recently, the computing science ....
Sakaguchi, M. and Sakai, S. (1992). Solutions of some three-person stud and draw poker. Mathematics Japonica, 6(37):1147-1160.
Computer Poker - Billings (1995) (2 citations) (Correct)
....purely mathematical approach may eventually produce some tangible dividends for poker practitioners. For example, in one of their most recent articles, Sakaguchi and Sakai solve (from a purely mathematical standpoint) some of the fundamentally difficult problems in three person playing scenarios [76]. While these papers may be of limited practical value, it is important to maintain a mathematically precise view of the game. Toward this end, some background in probability theory is essential for academic poker researchers. While this knowledge can be acquired in many ways, one strongly ....
M Sakaguchi and S Sakai, Solutions of Some Three-Person Stud and Draw Poker, Math. Japonica 37, no.6, (1992), 1147-1160.
Approximating Game-Theoretic Optimal Strategies for .. - Billings, Burch.. (2003) (7 citations) (Correct)
No context found.
M. Sakaguchi and S. Sakai. Solutions of some three-person stud and draw poker. Mathematics Japonica, pages 1147--1160, 1992.
Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002) (165 citations) (Correct)
No context found.
M. Sakaguchi, S. Sakai, Solutions of some three-person stud and draw poker, Mathematics Japonica 6 (37) (1992) 1147--1160.
Approximating Game-Theoretic Optimal Strategies for.. - Billings Burch Davidson (2003) (7 citations) (Correct)
No context found.
M. Sakaguchi and S. Sakai. Solutions of some three-person stud and draw poker. Mathematics Japonica, pages 1147--1160, 1992.
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