## Plans for February 15 Class (Borel and Von Neumann Poker Models)

on February 7th, 2011 at 10:49 pmWe’ll be discussing two papers: *On the Borel and von Neumann Poker Models* and *Best Response to Tight and Loose Opponents in the Borel and von Neumann Poker Models *with further emphasis on the former*. *You can find links to them below:

http://www.math.ucla.edu/~tom/papers/poker1.pdf

http://math.arizona.edu/~caseyw/poker.pdf

EDIT 2/11/11: In case anyone is getting confused by the missing figures in the second article, I have posted recreations of what I believe the author was trying to show. (Figure 2, Figure 4). The remaining figures are essentially the betting trees from the first article.

Like with the AKQ lecture, we’ll also give you some time to play the games to see what they’re like. We’ll use the following site to help generate random numbers:

http://www.cs.virginia.edu/~mky7b/cs6501poker/rng.html

Additional papers related to the topic are given below that go into the math and derivations a bit more heavily. These won’t be discussed but are provided in case you are interested.

http://www.archive.org/details/theoryofgamesand030098mbp (*Theory of Games and Economic Behavior*, focus on section 19)

http://www.math.ucla.edu/~tom/papers/poker2.pdf (*Uniform(0,1) Two-Person Poker Models*)

http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.dmj/1077468915 (*A Continuous Poker Game*)

Sounds excellent. Some of you may be interested that the author of the first paper, Chris Ferguson, spent 13 years completing a CS PhD at UCLA, and then went to win the World Series of Poker in 2000. See

http://www.chrisferguson.com/biofor more info.