A Brownian ratchet is a one-dimensional diffusion process that drifts towards a minimum of a periodic asymmetric sawtooth potential. A flashing Brownian ratchet is a process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, producing directed motion. These processes have been of interest to physicists and biologists for nearly 25 years. The flashing Brownian ratchet is the process that motivated Parrondo’s paradox, in which two fair games of chance, when alternated, produce a winning game. Parrondo’s games are relatively simple, being discrete in time and space. The flashing Brownian ratchet is rather more complicated. We show how one can study the latter process numerically using a random walk approximation.
Snackjack is a highly simplified version of blackjack that was proposed by Ethier (2010) and given its name by Epstein (2013). The eight-card deck comprises two aces, two deuces, and four treys, with aces having value either 1 or 4, and deuces and treys having values 2 and 3, respectively. The target total is 7 (vs. 21 in blackjack), and ace-trey is a natural. The dealer stands on 6 and 7, including soft totals, and otherwise hits. The player can stand, hit, double, or split, but split pairs receive only one card per paircard (like split aces in blackjack), and there is no insurance. We analyze the game, both single and multiple deck, deriving basic strategy and one-parameter card-counting systems. Unlike in blackjack, these derivations can be done by hand, though it may nevertheless be easier and more reliable to use a computer. More importantly, the simplicity of snackjack allows us to do computations that would be prohibitively time-consuming at blackjack. We can thereby enhance our understanding of blackjack by thoroughly exploring snackjack.
1 September 2019 in Journal of Applied Probability
Parrondo’s coin-tossing games were introduced as a toy model of the flashing Brownian ratchet in statistical physics but have emerged as a paradigm for a much broader phenomenon that occurs if there is a reversal in direction in some system parameter when two similar dynamics are combined. Our focus here, however, is on the original Parrondo games, usually labeledAandB. We show that if the parameters of the games are allowed to be arbitrary, subject to a fairness constraint, and if the two (fair) gamesAandBare played in an arbitrary periodic sequence, then the rate of profit can not only be positive (the so-called Parrondo effect), but can also be arbitrarily close to 1 (i.e. 100%).
23 September 2006 in Mathematical Methods of Operations Research
There are 134,459 distinct initial hands at the video poker game Jacks or Better, taking suit exchangeability into account. A computer program can determine the optimal strategy (i.e., which cards to hold) for each such hand, but a complete list of these strategies would require a book-length manuscript. Instead, a hand-rank table, which fits on a single page and reproduces the optimal strategy perfectly, was found for Jacks or Better as early as the mid 1990s. Is there a systematic way to derive such a hand-rank table? We show that there is indeed, and it involves finding the exact optimal conditional expected return, given the initial hand. In the case of Jacks or Better (paying 800, 50, 25, 9, 6, 4, 3, 2, 1, 0), this is a random variable with 1,153 distinct values, of which 766 correspond to garbage hands for which it is optimal to draw five new cards. We describe the hands corresponding to each of the remaining 387 values of the optimal conditional expected return (sorted from largest to smallest) and show how this leads readily to an optimal strategy hand-rank table for Jacks or Better. Of course, the method applies to other video poker games as well.