On the best-choice problem when the number of observations is random

Author:

Petruccelli Joseph D.

Abstract

We consider the problem of maximizing the probability of choosing the largest from a sequence of N observations when N is a bounded random variable. The present paper gives a necessary and sufficient condition, based on the distribution of N, for the optimal stopping rule to have a particularly simple form: what Rasmussen and Robbins (1975) call an s(r) rule. A second result indicates that optimal stopping rules for this problem can, with one restriction, take virtually any form.

Publisher

Cambridge University Press (CUP)

Subject

Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability

Reference6 articles.

1. Recognizing the Maximum of a Sequence

2. The best choice problem for a random number of objects;Presman;Theory Prob. Appl.,1972

3. Optimal selection based on relative ranks with a random number of individuals

4. On the best choice problem with random population size;Irle;Z. Operat. Res.,1980

5. A generalized choice problem

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Urn sampling distributions giving alternate correspondences between two optimal stopping problems;Advances in Applied Probability;2016-09

2. Secretary Problem;Wiley StatsRef: Statistics Reference Online;2014-09-29

3. Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon;Advances in Applied Probability;2013-12

4. Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon;Advances in Applied Probability;2013-12

5. Duration problem with multiple exchanges;Numerical Algebra, Control and Optimization;2012-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3