N-player Ruin Problem
The above described problem (2 players) is a special case of the so-called N-Player ruin problem. Here players with initial capital dollars, respectively, play a sequence of (arbitrary) independent games and win and lose certain amounts of dollars from/to each other according to fixed rules. The sequence of games ends as soon as at least one player is ruined. Standard Markov chain methods can be applied to solve in principle this more general problem, but the computations quickly become prohibitive as soon as the number of players or their initial capital increase. For and large initial capitals the solution can be well approximated by using two-dimensional Brownian motion. (For this is not possible.) In practice the true problem is to find the solution for the typical cases of and limited initial capital. Swan (2006) proposed an algorithm based on Matrix-analytic methods (Folding algorithm for ruin problems) which reduces, in such cases, the order of the computational task significantly.
Read more about this topic: Gambler's Ruin
Famous quotes containing the words ruin and/or problem:
“Oh, let me midlife mourn by the shrined
And druid herons’ vows
The voyage to ruin I must run,
Dawn ships clouted aground,
Yet, though I cry with tumbledown tongue,
Count my blessings aloud....”
—Dylan Thomas (1914–1953)
“The government is huge, stupid, greedy and makes nosy, officious and dangerous intrusions into the smallest corners of life—this much we can stand. But the real problem is that government is boring. We could cure or mitigate the other ills Washington visits on us if we could only bring ourselves to pay attention to Washington itself. But we cannot.”
—P.J. (Patrick Jake)