Optimal cooperative stopping rules for maximization of the product of the expected stopped values
โ Scribed by David Assaf; Ester Samuel-Cahn
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 561 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
โฆ Synopsis
The problem of finding stopping rules which maximize (EXt)(EYt) is considered, for independent pairs (X,, Yi) of nonnegative r.v.s with known joint distribution. The solution is compared to that of maximizing E(Xt Yt). When (X,, Y,) are uniform, a detailed analysis is given for the maximization problem, and for the corresponding minimization and discounted infinite horizon problems. (~
๐ SIMILAR VOLUMES
The unconstrained global programming problem is addressed using a multistart, multialgorithm infrastructure, in which different algorithms compete in parallel for a contribution towards a single global stopping criterion, denoted the unified Bayesian global stopping criterion. The use of different