In prophet problems, two players with different levels of information make decisions to optimize their return from an underlying optimal stopping problem. The player with more information is called the "prophet" while the player with less information is known as the "gambler." In this thesis, as in the majority of the literature on such problems, we assume that the prophet is omniscient, and the gambler does not know future outcomes when making his decisions. Certainly, the prophet will get a better return than the gambler. But how much better? The goal of a prophet problem is to find the least upper bound on the difference (or ratio) between the prophet's return, M, and the gambler's return, V. In this thesis, we present new prophet problems where we seek the least upper bound on M-V when there is a fixed cost per observations. Most prophet problems in the literature compare M and V when prophet and gambler buy (or sell) one asset. The new prophet problems presented in Chapters 3 and 4 treat a scenario where prophet and gambler optimize their return from selling two assets, when there is a fixed cost per observation. Sharp bounds for the problems on small time horizons are given; for the n-day problem, rough bounds and a description of the distributions for the random variables that maximize M-V are presented.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc1538720 |
| Date | 08 1900 |
| Creators | Brophy, Edmond M. |
| Contributors | Allaart, Pieter, Liu, Jianguo, Quintanilla, John |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | v, 108 pages, Text |
| Rights | Public, Brophy, Edmond M., Copyright, Copyright is held by the author, unless otherwise noted. All rights Reserved. |
Page generated in 0.0024 seconds