|
|
Hi,
Assume we have two lists of sizes n1 and n2. At each time step, we
choose one list at random and remove the topmost element of it. We
repeat until we run out of elements completely (Once one list is
eliminated, it becomes a deterministic process).
I am interested in the probability that the last element picked will be
from list 1.
This is a function of both n1 and n2
f(n1,n2) = Pr { last element picked will be from list containing n1,
assuming the other list has n2 elements)
Is there any famous problem that this problem reduces to? For example,
can it be reduced to a random walk?
Thanks a lot in advance
|
|