Odds -theorem and monotonicity

• Autorzy: F. Thomas Bruss
• Języki publikacji: EN

Abstrakty

EN

Given a finite sequence of events and a well-defined notion of events being interesting, the Odds-theorem (Bruss(2000)) gives an online strategy to stop on the last interesting event. This strategy is optimal for independent events, and it is obtained in a straightforward way by an algorithm which is optimal itself (odds-algorithm). Here we study questions in how far the optimal value mirrors monotonicity properties of the underlying sequence of probabilities of events. We make these questions precise, motivate them, and then give complete answers. The motivation is enhanced by certain problems where it seems desirable to apply the odds-algorithm but where a lack of information does not allow to do so without incorporating sequential estimation. In view of this goal, the notion of a plug-in odds-algorithm is introduced. Several applications are included.

Słowa kluczowe

EN

Odds-algorithm; Secretary problem; Selection criteria; Multiple stopping problems; Group interviews; Games; Clinical trial; Prophet inequality

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 2019
• Tom: 47
• Numer: 1

Daty

wydano

2019

online

2019-07-17

Twórcy

autor

F. Thomas Bruss

Identyfikatory

DOI

10.14708/ma.v47i1.6481