Maximizing the variance of the time to ruin in a multiplayer game with selection

Ilie Grigorescu, Yi Ching Yao

Research output: Contribution to journalArticle

Abstract

We consider a game with K ≥ 2 players, each having an integer-valued fortune. On each round, a pair (i, j ) among the players with nonzero fortunes is chosen to play and the winner is decided by flipping a fair coin (independently of the process up to that time). The winner then receives a unit from the loser. All other playersffortunes remain the same. (Once a playerfs fortune reaches 0, this player is out of the game.) The game continues until only one player wins all. The choices of pairs represent the control present in the problem. While it is known that the expected time to ruin (i.e. expected duration of the game) is independent of the choices of pairs (i, j ) (the strategies), our objective is to find a strategy which maximizes the variance of the time to ruin. We show that the maximum variance is uniquely attained by the (optimal) strategy, which always selects a pair of players who have currently the largest fortunes. An explicit formula for the maximum value function is derived. By constructing a simple martingale, we also provide a short proof of a result of Ross (2009) that the expected time to ruin is independent of the strategies. A brief discussion of the (open) problem of minimizing the variance of the time to ruin is given.

Original languageEnglish (US)
Pages (from-to)610-630
Number of pages21
JournalAdvances in Applied Probability
Volume48
Issue number2
DOIs
StatePublished - Jun 1 2016

Fingerprint

Game
Optimal Strategy
Martingale
Value Function
Explicit Formula
Open Problems
Continue
Maximise
Unit
Integer
Strategy

Keywords

  • Dynamic programming
  • Gambler's ruin
  • Martingale
  • Stochastic control

ASJC Scopus subject areas

  • Applied Mathematics
  • Statistics and Probability

Cite this

Maximizing the variance of the time to ruin in a multiplayer game with selection. / Grigorescu, Ilie; Yao, Yi Ching.

In: Advances in Applied Probability, Vol. 48, No. 2, 01.06.2016, p. 610-630.

Research output: Contribution to journalArticle

@article{c6eb69cd4a59470888d69d886ad09bec,
title = "Maximizing the variance of the time to ruin in a multiplayer game with selection",
abstract = "We consider a game with K ≥ 2 players, each having an integer-valued fortune. On each round, a pair (i, j ) among the players with nonzero fortunes is chosen to play and the winner is decided by flipping a fair coin (independently of the process up to that time). The winner then receives a unit from the loser. All other playersffortunes remain the same. (Once a playerfs fortune reaches 0, this player is out of the game.) The game continues until only one player wins all. The choices of pairs represent the control present in the problem. While it is known that the expected time to ruin (i.e. expected duration of the game) is independent of the choices of pairs (i, j ) (the strategies), our objective is to find a strategy which maximizes the variance of the time to ruin. We show that the maximum variance is uniquely attained by the (optimal) strategy, which always selects a pair of players who have currently the largest fortunes. An explicit formula for the maximum value function is derived. By constructing a simple martingale, we also provide a short proof of a result of Ross (2009) that the expected time to ruin is independent of the strategies. A brief discussion of the (open) problem of minimizing the variance of the time to ruin is given.",
keywords = "Dynamic programming, Gambler's ruin, Martingale, Stochastic control",
author = "Ilie Grigorescu and Yao, {Yi Ching}",
year = "2016",
month = "6",
day = "1",
doi = "10.1017/apr.2016.17",
language = "English (US)",
volume = "48",
pages = "610--630",
journal = "Advances in Applied Probability",
issn = "0001-8678",
publisher = "University of Sheffield",
number = "2",

}

TY - JOUR

T1 - Maximizing the variance of the time to ruin in a multiplayer game with selection

AU - Grigorescu, Ilie

AU - Yao, Yi Ching

PY - 2016/6/1

Y1 - 2016/6/1

N2 - We consider a game with K ≥ 2 players, each having an integer-valued fortune. On each round, a pair (i, j ) among the players with nonzero fortunes is chosen to play and the winner is decided by flipping a fair coin (independently of the process up to that time). The winner then receives a unit from the loser. All other playersffortunes remain the same. (Once a playerfs fortune reaches 0, this player is out of the game.) The game continues until only one player wins all. The choices of pairs represent the control present in the problem. While it is known that the expected time to ruin (i.e. expected duration of the game) is independent of the choices of pairs (i, j ) (the strategies), our objective is to find a strategy which maximizes the variance of the time to ruin. We show that the maximum variance is uniquely attained by the (optimal) strategy, which always selects a pair of players who have currently the largest fortunes. An explicit formula for the maximum value function is derived. By constructing a simple martingale, we also provide a short proof of a result of Ross (2009) that the expected time to ruin is independent of the strategies. A brief discussion of the (open) problem of minimizing the variance of the time to ruin is given.

AB - We consider a game with K ≥ 2 players, each having an integer-valued fortune. On each round, a pair (i, j ) among the players with nonzero fortunes is chosen to play and the winner is decided by flipping a fair coin (independently of the process up to that time). The winner then receives a unit from the loser. All other playersffortunes remain the same. (Once a playerfs fortune reaches 0, this player is out of the game.) The game continues until only one player wins all. The choices of pairs represent the control present in the problem. While it is known that the expected time to ruin (i.e. expected duration of the game) is independent of the choices of pairs (i, j ) (the strategies), our objective is to find a strategy which maximizes the variance of the time to ruin. We show that the maximum variance is uniquely attained by the (optimal) strategy, which always selects a pair of players who have currently the largest fortunes. An explicit formula for the maximum value function is derived. By constructing a simple martingale, we also provide a short proof of a result of Ross (2009) that the expected time to ruin is independent of the strategies. A brief discussion of the (open) problem of minimizing the variance of the time to ruin is given.

KW - Dynamic programming

KW - Gambler's ruin

KW - Martingale

KW - Stochastic control

UR - http://www.scopus.com/inward/record.url?scp=84976348965&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976348965&partnerID=8YFLogxK

U2 - 10.1017/apr.2016.17

DO - 10.1017/apr.2016.17

M3 - Article

AN - SCOPUS:84976348965

VL - 48

SP - 610

EP - 630

JO - Advances in Applied Probability

JF - Advances in Applied Probability

SN - 0001-8678

IS - 2

ER -