Jiyeon Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiyeon Lee has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Stewart N. Ethier
Department of Mathematics University of Utah
15 shared publications - S. N. Ethier
Department of Mathematics University of Utah 155 South 1400 84112 East Salt Lake City UT USA
4 shared publications S. N. Ethier
University of Utah
3 shared publications- John Jungtae Kim
Allstate Insurance Company of Canada
2 shared publications André Dabrowski
Department of Mathematics and Statistics, University of Ottawa, Ottawa, Ontario, Canada K1N 6N5
1 shared publicationDaehyeon Jung
1 shared publication
Latest Publications
- 9 November 2023
- Published by World Scientific Pub Co Pte Ltd in Fluctuation and Noise Letters
- Vol. 23 (01)
Parrondo-Like Behavior in Continuous-Time Random Walks with Periodically Alternating Jumps
As a natural generalization of the discrete-time random walk, the continuous-time random walk (CTRW) has been applied to stochastic models with random dynamics in various fields. In this paper, we show that the deterministic alternation of two unbiased CTRWs can lead to a phenomenon similar to the Parrondo paradox, in which the asymptotic mean drift of the combined CTRW becomes positive or negative depending on the parameter values. This extends the case in which the paradox occurs due to the random combination of two CTRWs with memory shown by Montero [Phys. Rev. E 84 (2011) 051139].
- 9 November 2023
- Published by World Scientific Pub Co Pte Ltd in Fluctuation and Noise Letters
- Vol. 23 (01)
Parrondo-Like Behavior in Continuous-Time Random Walks with Periodically Alternating Jumps
As a natural generalization of the discrete-time random walk, the continuous-time random walk (CTRW) has been applied to stochastic models with random dynamics in various fields. In this paper, we show that the deterministic alternation of two unbiased CTRWs can lead to a phenomenon similar to the Parrondo paradox, in which the asymptotic mean drift of the combined CTRW becomes positive or negative depending on the parameter values. This extends the case in which the paradox occurs due to the random combination of two CTRWs with memory shown by Montero [Phys. Rev. E 84 (2011) 051139].
- Open Access
A game-theoretic analysis of baccara chemin de fer, II
In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a $2\times2^{484}$ matrix game) and Model B3 (a $2^5\times2^{484}$ matrix game), both of which depend on a positive-integer parameter $d$, the number of decks. The key to solving the game under Model B2 was what we called Foster's algorithm, which applies to additive $2\times2^n$ matrix games. Here "additive" means that the payoffs are additive in the $n$ binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the $100\,α$ percent commission on Banker (player II) wins, where $0\leα\le1/10$. Thus, the game now depends not just on the discrete parameter $d$ but also on a continuous parameter $α$. Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster's algorithm to additive $2\times2^n$ bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness.Open AccessA game-theoretic analysis of baccara chemin de fer, II
In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a $2\times2^{484}$ matrix game) and Model B3 (a $2^5\times2^{484}$ matrix game), both of which depend on a positive-integer parameter $d$, the number of decks. The key to solving the game under Model B2 was what we called Foster's algorithm, which applies to additive $2\times2^n$ matrix games. Here "additive" means that the payoffs are additive in the $n$ binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the $100\,α$ percent commission on Banker (player II) wins, where $0\leα\le1/10$. Thus, the game now depends not just on the discrete parameter $d$ but also on a continuous parameter $α$. Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster's algorithm to additive $2\times2^n$ bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness. - Open Access
A Game-Theoretic Analysis of Baccara Chemin de Fer, II
In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a matrix game) and Model B3 (a matrix game), both of which depend on a positive-integer parameter d, the number of decks. The key to solving the game under Model B2 was what we called Foster’s algorithm, which applies to additive matrix games. Here “additive” means that the payoffs are additive in the n binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the percent commission on Banker (player II) wins, where . Thus, the game now depends not just on the discrete parameter d but also on a continuous parameter . Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster’s algorithm to additive bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness.Open AccessA Game-Theoretic Analysis of Baccara Chemin de Fer, II
In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a matrix game) and Model B3 (a matrix game), both of which depend on a positive-integer parameter d, the number of decks. The key to solving the game under Model B2 was what we called Foster’s algorithm, which applies to additive matrix games. Here “additive” means that the payoffs are additive in the n binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the percent commission on Banker (player II) wins, where . Thus, the game now depends not just on the discrete parameter d but also on a continuous parameter . Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster’s algorithm to additive bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness. - 30 September 2022
- Published by Korean Data and Information Science Society in Journal of the Korean Data and Information Science Society
- Vol. 33 (5) , 857-868
Parrondo effect and its maximization in discrete-time dependent random walks
파론도 게임은 개별로 진행하면 공정한 게임이지만 두 게임을 임의의 확률로 혼합하여 진행하면 이기거나 지는 게임이 되는 역설적인 특징을 가진다. 파론도 게임의 매 시점의 상태가 이전 시점의 상태들에 종속하여 정해지기 때문에 각 게임의 점근적 평균값이 편의없이 0이더라도 두 게임을 임의적으로 혼합하면 점근적 평균값이 양수 또는 음수가 될 수 있기 때문이다. 기존의 파론도 게임은 이러한 상태 종속성을 이산시간의 단순 확률보행의 마르코프 연쇄 모형으로 설정하고 분석하였다. 본 논문에서는 기존의 단순 확률보행을 일반 이산확률분포의 도약크기를 가지는 종속 확률보행과 정규분포의 도약크기를 가지는 종속 확률보행으로 확대하여 파론도 효과의 존재 조건을 찾고 그 효과를 극대화 할 수 있는 혼합 가중값을 구한다.
- 30 September 2022
- Published by Korean Data and Information Science Society in Journal of the Korean Data and Information Science Society
- Vol. 33 (5) , 857-868
Parrondo effect and its maximization in discrete-time dependent random walks
파론도 게임은 개별로 진행하면 공정한 게임이지만 두 게임을 임의의 확률로 혼합하여 진행하면 이기거나 지는 게임이 되는 역설적인 특징을 가진다. 파론도 게임의 매 시점의 상태가 이전 시점의 상태들에 종속하여 정해지기 때문에 각 게임의 점근적 평균값이 편의없이 0이더라도 두 게임을 임의적으로 혼합하면 점근적 평균값이 양수 또는 음수가 될 수 있기 때문이다. 기존의 파론도 게임은 이러한 상태 종속성을 이산시간의 단순 확률보행의 마르코프 연쇄 모형으로 설정하고 분석하였다. 본 논문에서는 기존의 단순 확률보행을 일반 이산확률분포의 도약크기를 가지는 종속 확률보행과 정규분포의 도약크기를 가지는 종속 확률보행으로 확대하여 파론도 효과의 존재 조건을 찾고 그 효과를 극대화 할 수 있는 혼합 가중값을 구한다.
- Open Access
- 13 August 2020
- Published by University Libraries, University of Nevada, Las Vegas in UNLV Gaming Research & Review Journal
- Vol. 24 (1) , 4
Snackjack: A Toy Model of Blackjack
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.
- 13 August 2020
- Published by University Libraries, University of Nevada, Las Vegas in UNLV Gaming Research & Review Journal
- Vol. 24 (1) , 4
Open AccessSnackjack: A Toy Model of Blackjack
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
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 56 (4) , 1198-1216
How strong can the Parrondo effect be?
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%).
- 1 September 2019
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 56 (4) , 1198-1216
How strong can the Parrondo effect be?
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%).
- Open Access
- 17 March 2019
- Published by University Libraries, University of Nevada, Las Vegas in UNLV Gaming Research & Review Journal
- Vol. 23 (1) , 1
Optimal Conditional Expectation at the Video Poker Game Jacks or Better
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.
- 17 March 2019
- Published by University Libraries, University of Nevada, Las Vegas in UNLV Gaming Research & Review Journal
- Vol. 23 (1) , 1
Open AccessOptimal Conditional Expectation at the Video Poker Game Jacks or Better
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.
- Open Access
The tilted flashing Brownian ratchet
The flashing Brownian ratchet is a stochastic process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, the latter being a one-dimensional diffusion process that drifts towards a minimum of a periodic asymmetric sawtooth potential. The result is directed motion. In the presence of a static homogeneous force that acts in the direction opposite that of the directed motion, there is a reduction (or even a reversal) of the directed motion effect. Such a process may be called a tilted flashing Brownian ratchet. We show how one can study this process numerically, using a random walk approximation or, equivalently, using numerical solution of the Fokker-Planck equation. Stochastic simulation is another viable method.
Open AccessThe tilted flashing Brownian ratchet
The flashing Brownian ratchet is a stochastic process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, the latter being a one-dimensional diffusion process that drifts towards a minimum of a periodic asymmetric sawtooth potential. The result is directed motion. In the presence of a static homogeneous force that acts in the direction opposite that of the directed motion, there is a reduction (or even a reversal) of the directed motion effect. Such a process may be called a tilted flashing Brownian ratchet. We show how one can study this process numerically, using a random walk approximation or, equivalently, using numerical solution of the Fokker-Planck equation. Stochastic simulation is another viable method.
- 9 January 2019
- Published by World Scientific Pub Co Pte Ltd in Fluctuation and Noise Letters
- Vol. 18 (01)
The Tilted Flashing Brownian Ratchet
The flashing Brownian ratchet is a stochastic process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, the latter being a one-dimensional diffusion process that drifts towards a minimum of a periodic asymmetric sawtooth potential. The result is directed motion. In the presence of a static homogeneous force that acts in the direction opposite to that of the directed motion, there is a reduction (or even a reversal) of the directed motion effect. Such a process may be called a tilted flashing Brownian ratchet. We show how one can study this process numerically, using a random walk approximation or, equivalently, using numerical solution of the Fokker–Planck equation. Stochastic simulation is another viable method.
- 9 January 2019
- Published by World Scientific Pub Co Pte Ltd in Fluctuation and Noise Letters
- Vol. 18 (01)
The Tilted Flashing Brownian Ratchet
The flashing Brownian ratchet is a stochastic process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, the latter being a one-dimensional diffusion process that drifts towards a minimum of a periodic asymmetric sawtooth potential. The result is directed motion. In the presence of a static homogeneous force that acts in the direction opposite to that of the directed motion, there is a reduction (or even a reversal) of the directed motion effect. Such a process may be called a tilted flashing Brownian ratchet. We show how one can study this process numerically, using a random walk approximation or, equivalently, using numerical solution of the Fokker–Planck equation. Stochastic simulation is another viable method.
- Open Access
- 31 January 2018
- Published by Korean Data and Information Science Society in Journal of the Korean Data and Information Science Society
- Vol. 29 (1) , 189-202
New approximation method for ruin probabilities using the mixture of exponential distributions
Daehyeon Jung · Jiyeon Lee. JKDISS 2018;29:189-202. https://doi.org/
- 31 January 2018
- Published by Korean Data and Information Science Society in Journal of the Korean Data and Information Science Society
- Vol. 29 (1) , 189-202
Open AccessNew approximation method for ruin probabilities using the mixture of exponential distributions
Daehyeon Jung · Jiyeon Lee. JKDISS 2018;29:189-202. https://doi.org/