Standard

Optimal Stopping Strategies in Gambler’s Ruin Game. / Mazalov, Vladimir; Ivashko, Anna.

2024. 237-249 Работа представлена на 23 International Conference on Mathematical Optimization Theory and Operations Research , Омск, Российская Федерация.

Результаты исследований: Материалы конференцийматериалыРецензирование

Harvard

Mazalov, V & Ivashko, A 2024, 'Optimal Stopping Strategies in Gambler’s Ruin Game', Работа представлена на 23 International Conference on Mathematical Optimization Theory and Operations Research , Омск, Российская Федерация, 30/06/24 - 6/07/24 стр. 237-249. https://doi.org/10.1007/978-3-031-73365-9_16

APA

Mazalov, V., & Ivashko, A. (2024). Optimal Stopping Strategies in Gambler’s Ruin Game. 237-249. Работа представлена на 23 International Conference on Mathematical Optimization Theory and Operations Research , Омск, Российская Федерация. https://doi.org/10.1007/978-3-031-73365-9_16

Vancouver

Mazalov V, Ivashko A. Optimal Stopping Strategies in Gambler’s Ruin Game. 2024. Работа представлена на 23 International Conference on Mathematical Optimization Theory and Operations Research , Омск, Российская Федерация. https://doi.org/10.1007/978-3-031-73365-9_16

Author

Mazalov, Vladimir ; Ivashko, Anna. / Optimal Stopping Strategies in Gambler’s Ruin Game. Работа представлена на 23 International Conference on Mathematical Optimization Theory and Operations Research , Омск, Российская Федерация.13 стр.

BibTeX

@conference{168a345cbdc04c0d8a3bae826dc32606,
title = "Optimal Stopping Strategies in Gambler{\textquoteright}s Ruin Game",
abstract = "We consider a game-theoretic version of the gambler{\textquoteright}s ruin problem. In each of the n steps, two players with different capitals compete over a unit of capital. The players{\textquoteright} chances in each step are equal. Accordingly, the capital of each player can increase or decrease by one unit with equal probability. The player wins if the opponent runs out of capital. In this case, the player gets 1 as payoff. If the game has not ended within the time interval n, then the players gain nothing. At each step, the players are required to pay a value of c. Two variants of the game are examined: one where one player{\textquoteright}s capital is infinite, and the other where both players{\textquoteright} capitals are infinite. The player{\textquoteright}s strategy is the stopping time in the game in order to maximize the expected payoff. The players{\textquoteright} optimal stopping strategies and payoffs are determined. The numerical results of payoff simulation for different n are reported.",
author = "Vladimir Mazalov and Anna Ivashko",
year = "2024",
month = dec,
doi = "10.1007/978-3-031-73365-9_16",
language = "English",
pages = "237--249",
note = "XXIII International Conference Mathematical Optimization Theory and Operations Research, MOTOR-2024 ; Conference date: 30-06-2024 Through 06-07-2024",
url = "https://motor24.oscsbras.ru/pages/en_index.html",

}

RIS

TY - CONF

T1 - Optimal Stopping Strategies in Gambler’s Ruin Game

AU - Mazalov, Vladimir

AU - Ivashko, Anna

N1 - Conference code: 23

PY - 2024/12

Y1 - 2024/12

N2 - We consider a game-theoretic version of the gambler’s ruin problem. In each of the n steps, two players with different capitals compete over a unit of capital. The players’ chances in each step are equal. Accordingly, the capital of each player can increase or decrease by one unit with equal probability. The player wins if the opponent runs out of capital. In this case, the player gets 1 as payoff. If the game has not ended within the time interval n, then the players gain nothing. At each step, the players are required to pay a value of c. Two variants of the game are examined: one where one player’s capital is infinite, and the other where both players’ capitals are infinite. The player’s strategy is the stopping time in the game in order to maximize the expected payoff. The players’ optimal stopping strategies and payoffs are determined. The numerical results of payoff simulation for different n are reported.

AB - We consider a game-theoretic version of the gambler’s ruin problem. In each of the n steps, two players with different capitals compete over a unit of capital. The players’ chances in each step are equal. Accordingly, the capital of each player can increase or decrease by one unit with equal probability. The player wins if the opponent runs out of capital. In this case, the player gets 1 as payoff. If the game has not ended within the time interval n, then the players gain nothing. At each step, the players are required to pay a value of c. Two variants of the game are examined: one where one player’s capital is infinite, and the other where both players’ capitals are infinite. The player’s strategy is the stopping time in the game in order to maximize the expected payoff. The players’ optimal stopping strategies and payoffs are determined. The numerical results of payoff simulation for different n are reported.

U2 - 10.1007/978-3-031-73365-9_16

DO - 10.1007/978-3-031-73365-9_16

M3 - Paper

SP - 237

EP - 249

T2 - XXIII International Conference Mathematical Optimization Theory and Operations Research

Y2 - 30 June 2024 through 6 July 2024

ER -

ID: 128691577