Lower bounds for bruss' odds problem with multiple stoppings

Tomomi Matsui, Katsunori Ano

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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 bound. Finally, we prove a conjecture on the classical secretary problem, which gives a connection between the probability of win and the threshold values of the optimal stopping strategy.

Original languageEnglish
Pages (from-to)700-714
Number of pages15
JournalMathematics of Operations Research
Volume41
Issue number2
DOIs
Publication statusPublished - 2016 May 1

Fingerprint

Random variables
Lower bounds
Secretary problem

Keywords

  • Lower bounds
  • Multiple stopping
  • Odds problem
  • Optimal stopping

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Lower bounds for bruss' odds problem with multiple stoppings. / Matsui, Tomomi; Ano, Katsunori.

In: Mathematics of Operations Research, Vol. 41, No. 2, 01.05.2016, p. 700-714.

Research output: Contribution to journalArticle

Matsui, Tomomi ; Ano, Katsunori. / Lower bounds for bruss' odds problem with multiple stoppings. In: Mathematics of Operations Research. 2016 ; Vol. 41, No. 2. pp. 700-714.
@article{ff3b3df1cb3a460c836f16aaf87580f4,
title = "Lower bounds for bruss' odds problem with multiple stoppings",
abstract = "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 bound. Finally, we prove a conjecture on the classical secretary problem, which gives a connection between the probability of win and the threshold values of the optimal stopping strategy.",
keywords = "Lower bounds, Multiple stopping, Odds problem, Optimal stopping",
author = "Tomomi Matsui and Katsunori Ano",
year = "2016",
month = "5",
day = "1",
doi = "10.1287/moor.2015.0748",
language = "English",
volume = "41",
pages = "700--714",
journal = "Mathematics of Operations Research",
issn = "0364-765X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - Lower bounds for bruss' odds problem with multiple stoppings

AU - Matsui, Tomomi

AU - Ano, Katsunori

PY - 2016/5/1

Y1 - 2016/5/1

N2 - 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 bound. Finally, we prove a conjecture on the classical secretary problem, which gives a connection between the probability of win and the threshold values of the optimal stopping strategy.

AB - 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 bound. Finally, we prove a conjecture on the classical secretary problem, which gives a connection between the probability of win and the threshold values of the optimal stopping strategy.

KW - Lower bounds

KW - Multiple stopping

KW - Odds problem

KW - Optimal stopping

UR - http://www.scopus.com/inward/record.url?scp=84963750713&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84963750713&partnerID=8YFLogxK

U2 - 10.1287/moor.2015.0748

DO - 10.1287/moor.2015.0748

M3 - Article

AN - SCOPUS:84963750713

VL - 41

SP - 700

EP - 714

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 2

ER -