Lower Bounds for Bruss' Odds Problem with Multiple Stoppings

  title={Lower Bounds for Bruss' Odds Problem with Multiple Stoppings},
  author={Tomomi Matsui and Ano Katsunori},
  journal={Math. Oper. Res.},
This paper addresses Bruss’ odds problem with multiple stopping chances. A decision maker sequentially observes a sequence of independent 0/1 (failure/success) random variables to correctly predict the last success with multiple stopping chances. First, we give a nontrivial lower bound of the probability of win (obtaining the last success) for the problem with m -stoppings. Next, we show that the asymptotic value for each classical secretary problem with multiple stoppings attains our lower… 

Figures, Tables, and Topics from this paper

Odds -theorem and monotonicity
  • F. Bruss
  • Mathematics
    Mathematica Applicanda
  • 2019
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. It is optimal
A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber
The contribution in the present paper is a refined analysis of several problems in this class and a study of the asymptotic behaviour of solutions.
Dynamic Programming and Linear Programming for Odds Problem
This paper discusses the odds problem, proposed by Bruss in 2000, and its variants. A recurrence relation called a dynamic programming (DP) equation is used to find an optimal stopping policy of the
Secretary Problem with quality-based payoff
We consider a variant of the classical Secretary Problem. In this setting, the candidates are ranked according to some exchangeable random variable and the quest is to maximize the expected quality
On the $1/e$-strategy for the best-choice problem under no information
The main purpose of this paper is to correct an error in the previously submitted version [*] := arXiv:2004.13749v1, and to show where exactly the error occurred, why it invalidates its main theorem and title, and what the conclusions are.
On a Competitive Secretary Problem with Deferred Selections
The novelty in this paper is in introducing a multi-agent model in which the competition is endogenous, and it is shown that as the number of agents grows, the winning probability of every agent under non-immediate selections approaches her winning probability under immediate selections.
Stochastic Input Models in Online Computing
This paper studies twelve stochastic input models for online problems and reveals the relationships among the competitive ratios for the models, and considers two basic online problems, which are variants of the secretary problem and the prophet inequality problem, under the models.
Generalization on optimal multiple stopping with application to swing options with random exercise rights number
This paper develops the theory of optimal multiple stopping times expected value problems by stating, proving, and applying a dynamic programming principle for the case in which both the reward
Prophet Inequality with Competing Agents
A model of competing agents in a prophet setting, where rewards arrive online, and decisions are made immediately and irrevocably, and shows a correspondence between the equilibrium of the k-agent game and the optimal strategy of a single decision maker who can select up to k rewards.
Combined Games with Randomly Delayed Beginnings
This paper presents two-person games involving optimal stopping, with randomised choice-priority, between two games G1 and G2, and discusses under which circumstances they can obtain solutions, or approximate solutions.


Odds Theorem with Multiple Selection Chances
We study the multi-selection version of the so-called odds theorem by Bruss (2000). We observe a finite number of independent 0/1 (failure/success) random variables sequentially and want to select
A note on bounds for the odds theorem of optimal stopping
The odds theorem gives a unified answer to a class of stopping problems on sequences of independent indicator functions. The success probability of the optimal rule is known to be larger than Re -R ,
The Sum-the-Odds Theorem with Application to a Stopping Game of Sakaguchi
The optimal stopping problem of maximizing the probability of stopping on the last success of a finite sequence of independent Bernoulli trials has been studied by Hill and Krengel (1992), Hsiau and
The optimal stopping rules with multiple selections of m 1 objects with the objective of maximizing the probability of obtaining the best object are studied for two problems with an unknown number of
Sum the odds to one and stop
The objective of this paper is to present two theorems which are directly applicable to optimal stopping problems involving independent indicator functions. The proofs are elementary. One implication
A universal bound for the maximal expected reward is obtained for stopping a sequence of independent random variables where the reward is a nonincreasing function of the rank of the variable
Recognizing the Maximum of a Sequence
Abstract The classical dowry, secretary, or beauty contest problem is extended in several directions. In trying to find sequentially the maximum of a random sequence of fixed length, the chooser can
A Prophet Inequality Related to the Secretary Problem
Let Z1, Zz , .. . , Zn be iudP.pcndent 0-1 -vahtt-d ranrlom vari­ ables. A gambler gels a. reward 1 if he st op8 a.t the time of the last success anrl otherwise gets no reward. A simple comparison
Selecting a sequence of last successes in independent trials
Let I1, I2, . . . , In be a sequence of independent indicator functions de- fined on a probability space (Ω, A, P ). We say that index k is a success time if Ik = 1. The sequence I1, I2, . . . , In
Simple ratio prophet inequalities for a mortal with multiple choices
Let X i ≥ 0 be independent, i = 1,…, n, with known distributions and let X n *= max(X 1,…,X n ). The classical ‘ratio prophet inequality’ compares the return to a prophet, which is EX n *, to that of