Content deleted Content added
No edit summary |
|||
Line 64:
There exists, in the same spirit, an Odds-Theorem for continuous-time arrival processes with independent increments such as the [[Poisson process]] (Bruss (2000)). In some cases, the odds are not necessarily known in advance (as in Example 2 above) so that the application of the odds-algorithm is not directly possible. In this case each step can use [[sequential estimates]] of the odds. This is meaningful, if the number of unknown parameters is not large compared with the number n of observations. The question of optimality is then more complicated, however, and requires additional studies. Generalizations of the odds-algorithm allow for different rewards for failing to stop
and wrong stops as well as replacing independence assumptions by weaker ones (Ferguson (2008)).
== See also ==
| |||