Timeline for Finding the Nash Equilibrium of $0-1$ poker with one betting round
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 19, 2012 at 2:25 | vote | accept | Paul | ||
| Jun 18, 2012 at 18:24 | history | edited | Douglas Zare | CC BY-SA 3.0 |
changed title and changed "raise" to "bet"
|
| Jun 18, 2012 at 18:16 | answer | added | Douglas Zare | timeline score: 7 | |
| Jun 18, 2012 at 14:43 | comment | added | Douglas Zare | Also, the first money into the pot after the ante should be called a bet not a raise, and the formulas you get are a bit simpler if you assume that the winner of a showdown is the player with the lower number, not the higher number. | |
| Jun 18, 2012 at 14:42 | comment | added | Douglas Zare | When I have time, I may turn this comment into an answer. This game and many related $0-1$ games were studied by Bill Chen and Jerrod Ankenman, with many results posted to the newsgroup rec.gambling.poker in 2003, and some examples written up in their book The Mathematics of Poker, not to be confused with my book The Math of Hold'em which does not contain analyses of $0-1$ games. Chen and Ankenman solved more complicated games than this one, but you may want to start with the simpler example in which only one player may bet. | |
| Jun 18, 2012 at 9:22 | history | edited | Paul | CC BY-SA 3.0 |
More info on what the formula means and tag added
|
| Jun 18, 2012 at 6:01 | history | asked | Paul | CC BY-SA 3.0 |