The asymptotics of group Russian roulette

Abstract

We study the group Russian roulette problem, also known as the shooting problem, defined as follows. We have $n$ armed people in a room. At each chime of a clock, everyone shoots a random other person. The persons shot fall dead and the survivors shoot again at the next chime. Eventually, either everyone is dead or there is a single survivor. We prove that the probability $p_n$ of having no survivors does not converge as $n\to \infty$, and becomes asymptotically periodic and continuous on the $\log n$ scale, with period 1.

26 pages, 1 figure; Mathematica notebook and output file (calculated exact bounds) are included with the source files

Cited by in corpus (3)

• Optimal Strategy in "Guess Who?": Beyond Binary Search
• Self-averaging sequences which fail to converge
• Errata and Addenda to Mathematical Constants