Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Robbins' Problem (of Optimal Stopping)

Robbins' Problem (of Optimal Stopping)

Marseken, Susan F.
Surhone, Lambert M.
Timpledon, Miriam T.

Paperback

General Mathematics

Currently unavailable to order

ISBN10: 6132172009
ISBN13: 9786132172006
Publisher: Vdm Verlag Dr Mller Ag & Co Kg
Pages: 104
Weight: 0.36
Height: 0.25 Width: 9.02 Depth: 6.00
Language: English
High Quality Content by WIKIPEDIA articles! In probability theory, Robbins' problem of optimal stopping, named after Herbert Robbins, is sometimes referred to as the fourth secretary problem or the problem of minimizing the expected rank with full information. Its statement is as follows. Let X1, ..., Xn be independent, identically distributed random variables, uniform on [0, 1]. We observe the Xk's sequentially and must stop on exactly one of them. No recall of preceding observations is permitted. What stopping rule minimizes the expected rank of the selected observation, and what is its corresponding value? The general solution to this full-information expected rank problem is unknown. The major difficulty is that the problem is fully history-dependent, that is, the optimal rule depends at every stage on all preceding values, and not only on simpler sufficient statistics of these.

Also in

General Mathematics

View All