The secretary problem for a random walk
- Publication date
- Publisher
Abstract
The secretary problem for a random walk is described. A particle has equal probabilities of moving j steps up or j steps down. The optimal strategy of picking the maximum height in n steps without the opportunity of recall is found. The best strategy is shown to be exactly the same as the naive strategy of choosing the first element of the sequence. The theory is extended to symmetric continuous distributions.secretary problem random walk optimal stopping