Back to search

University of North Texas

A Random Walk Version of Robbins' Problem

Abstract

dc:description

Robbins' problem is an optimal stopping problem where one seeks to minimize the expected rank of their observations among all observations. We examine random walk analogs to Robbins' problem in both discrete and continuous time. In discrete time, we consider full information and relative ranks versions of this problem. For three step walks, we give the optimal stopping rule and the expected rank for both versions. We also give asymptotic upper bounds for the expected rank in discrete time. Finally, we give upper and lower bounds for the expected rank in continuous time, and we show that the expected rank in the continuous time problem is at least as large as the normalized asymptotic expected rank in the full information discrete time version.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Allen, Andrew
Contributors dc:contributor
  • Allaart, Pieter C.
  • Quintanilla, John
  • Song, Kai-Sheng

Subjects

dc:subject × 13

Rights

dc:rights
Statement dc:rights
  • Public
  • Allen, Andrew
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights Reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
local-cont-no: submission_1419
https://digital.library.unt.edu/ark:/67531/metadc1404568/
ark: ark:/67531/metadc1404568

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

Allen, Andrew. A Random Walk Version of Robbins' Problem. University of North Texas, 2018. https://doi.org/10.12794/metadc1404568