rent-now

Rent More, Save More! Use code: ECRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

9783540740100

Optimal Stopping Rules

by ;
  • ISBN13:

    9783540740100

  • ISBN10:

    3540740104

  • Edition: Reprint
  • Format: Paperback
  • Copyright: 2007-12-01
  • Publisher: Springer Nature
  • Purchase Benefits
  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $89.99 Save up to $57.95
  • Digital
    $69.42*
    Add to Cart

    DURATION
    PRICE
    *To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.

Summary

Although three decades have passed since first publication of this book reprinted now as a result of popular demand, the content remains up-to-date and interesting for many researchers as is shown by the many references to it in current publications.

Table of Contents

Random Processes: Markov Timesp. 1
Background material from the theory of probabilityp. 1
Markov timesp. 5
Martingales and semimartingalesp. 15
Markov processesp. 18
Notes to Chapter 1p. 24
Optimal Stopping of Markov Sequencesp. 25
Statement of the problem of optimal stoppingp. 25
Optimal stopping rules in the classes [characters not reproducible](n) and [characters not reproducible](m; n)p. 28
An optimal selection problemp. 35
Excessive functions and smallest excessive majorantsp. 39
The excessive characterization of the payoff and [epsilon]-optimal stopping rules (under the condition A[superscript -])p. 50
Examplesp. 57
The structure and methods of finding a payoff for a function g [set membership] B (a[superscript -])p. 64
Regular functions: the structure of the payoff and [epsilon]-optimal stopping rules (under the condition A[superscript +])p. 68
Regular characterization of the payoff (the general case)p. 75
Convergence of the payoffs s[subscript n](x) and the optimal times [tau superscript * subscript n] as n to [infinity]p. 76
Solutions of recursive equations f(x) = max{g(x, Tf(x)}p. 79
Criteria for the truncation of optimal stopping rulesp. 86
Randomized and sufficient classes of stopping timesp. 90
Optimal stopping of a Markov sequence allowing for the cost of observationp. 93
Reduction of the optimal stopping problem for arbitrary random sequences to the corresponding problem for Markov processesp. 100
Notes to Chapter 2p. 111
Optimal Stopping of Markov Processesp. 113
The statement of the problem and main definitionsp. 113
Regular and excessive functions: excessive majorantsp. 115
Excessive characterization of the payoff and [epsilon]-optimal stopping times (under the condition A[superscript -])p. 124
Regular characterization of the payoff and [epsilon]-optimal stopping times (under the condition A[superscript +])p. 129
Regular characterization of the payoff (the general case)p. 138
The construction of regular majorantsp. 142
[epsilon](x)-optimal Markov timesp. 153
Equations for the payoff and generalized Stefan problem: the conditions for "smooth pasting"p. 157
Notes to Chapter 3p. 162
Some Applications to Problems of Mathematical Statisticsp. 163
The sequential testing of two simple hypotheses (discrete time)p. 163
Sequential testing of two simple hypotheses on the mean of a Wiener processp. 180
The problem of disruption (discrete time)p. 193
The problem of disruption for a Wiener processp. 200
Notes to Chapter 4p. 207
Bibliographyp. 208
Indexp. 215
Table of Contents provided by Ingram. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program