Paper Info
Title
On the minimum expected duration of a coin tossing game
Abstract
The following coin tossing game is analyzed: a store of N fair coins is given and it is desired to achieve M heads in a round of tosses of the coins. To allow for unfavorable sequences of tails, restarts are permitted at any epoch in the game where, in any restart, all coins are returned to store and tosses are begun anew from tabula rasa. A restart strategy is a prescription that specifies when a restart should be made. It is desired to estimate the minimum expected duration of the game over all restart strategies, and to find an optimal strategy that minimizes the expected duration of the game. This simple coin tossing game, proposed by R.L. Rivest, has cryptographic roots and is linked to issues in the factoring of integers
Year
DOI
Venue
1993
10.1109/18.212287
IEEE Transactions on Information Theory
Keywords
DocType
Volume
cryptographic roots,coin tossing game,tabula rasa,cryptographic root,n fair coin,expected duration,r.l. rivest,information theory,game theory,minimum expected duration,simple coin,following coin,unfavorable sequence,optimal strategy,restart strategy,cryptography,statistics,tail
Journal
39
Issue
ISSN
Citations 
2
0018-9448
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
inchi hu100.34
Santosh S. Venkatesh238171.80