n independent agents each announce with probability p. A leader is selected only when exactly one announces. Which p…
Quant ResearchLevel: IntermediateExactly-one optimization
n independent agents each announce with probability p. A leader is selected only when exactly one announces. Which p maximizes success, and what is the large-n limit?
Hints
- Write the binomial probability of one success.
- Differentiate the log and check endpoints.
Answer
Success is np(1-p)^(n-1). For n>1, differentiating its log gives 1/p-(n-1)/(1-p)=0, so p=1/n. Success is (1-1/n)^(n-1), approaching e^-1. For n=1 choose p=1.
Source and licence: Lehman, Leighton & Meyer — Mathematics for Computer Science (2018-06-06) · CC-BY-SA-3.0 · answer: Quantoros editorial