Back to search

University of North Texas

Optimal Strategies for Stopping Near the Top of a Sequence

Abstract

dc:description

In Chapter 1 the classical secretary problem is introduced. Chapters 2 and 3 are variations of this problem. Chapter 2, discusses the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter p and finite time horizon n. The optimal strategy (continue or stop) depends on a sequence of threshold values (critical probabilities) which has an oscillating pattern. Several properties of this sequence have been proved by Dr. Allaart. Further properties have been recently proved. In Chapter 3, a gambler will observe a finite sequence of continuous random variables. After he observes a value he must decide to stop or continue taking observations. He can play two different games A) Win at the maximum or B) Win within a proportion of the maximum. In the first section the sequence to be observed is independent. It is shown that for each n>1, theoptimal win probability in game A is bounded below by (1-1/n)^{n-1}. It is accomplished by reducing the problem to that of choosing the maximum of a special sequence of two-valued random variables and applying the sum-the-odds theorem of Bruss (2000). Secondly, it is assumed the sequence is i.i.d. The best lower bounds are provided for the winning probabilities in game B given any continuous distribution. These bounds are the optimal win probabilities of a game A which was examined by Gilbert and Mosteller (1966).

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Islas Anguiano, Jose Angel
Contributors dc:contributor
  • Allaart, Pieter C.
  • Song, Kai-Sheng
  • Quintanilla, John
  • Monticino, Michael G.

Subjects

dc:subject × 7

Rights

dc:rights
Statement dc:rights
  • Public
  • Islas Anguiano, Jose Angel
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights Reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
https://digital.library.unt.edu/ark:/67531/metadc822812/
ark: ark:/67531/metadc822812

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Islas Anguiano, Jose Angel. Optimal Strategies for Stopping Near the Top of a Sequence. University of North Texas, 2015. https://doi.org/10.12794/metadc822812