Name
Abstract | ||
|---|---|---|
We consider a natural generalization of the classical ruin problem to more than two parties. Our "ruin" problem, which we will call the (k, I)-game, starts with k players each having I units as its initial capital. At each round of the game, all remaining k′ players pay 1/k′th unit as game fee, play the game, and one of the players wins and receives the combined game fees of 1 unit. A player who cannot pay the next game fee goes bankrupt, and the game terminates when all players but one are bankrupt.We analyze the length of the game, that is, the number of rounds executed until the game terminates, and give upper and lower bounds for the expected game length. |
Year | Venue | Keywords |
|---|---|---|
2001 | RANDOM-APPROX | k player,game fee,game terminates,initial capital,th unit,combined game fee,next game fee,generalized ruin problem,players win,expected game length,remaining k |
Field | DocType | Volume |
Simultaneous game,Discrete mathematics,Mathematical economics,Strategy,Computer science,Repeated game,Artificial intelligence,Sequential game,Screening game,Game tree,Non-cooperative game,Example of a game without a value | Conference | 2129 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-42470-9 | 1 |
PageRank | References | Authors |
0.63 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kazuyuki Amano | 1 | 1 | 0.63 |
| John Tromp | 2 | 124 | 12.85 |
| Paul Vitányi | 3 | 2130 | 287.76 |
| Osamu Watanabe | 4 | 960 | 104.55 |