Skip to main content
SpringerLink
Log in

On Dynkin's stopping problem with a finite constraint

  • Conference paper
  • First Online:
Book cover Probability Theory and Mathematical Statistics

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1299))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-M. Bismut: Sur un probleme de Dynkin, Z. Wahrsch. Verw. Gebiete 39 (1977), 31–53.

    Article  MathSciNet  MATH  Google Scholar 

  2. Y. S. Chow, H. Robbins and D. Siegmund: Great Expectations — The Theory of Optimal Stopping-, Houghton Mifflin, Boston (1971).

    MATH  Google Scholar 

  3. E. B. Dynkin: Game variant of a problem on optimal stopping, Soviet Math. Dokl. 10 (1969), 270–274.

    MATH  Google Scholar 

  4. N. V. Elbakidze: Construction of the cost and optimal policies in a game problem of stopping a Markov process, Theor.Prob.Appl. 21 (1976), 163–168.

    Article  MathSciNet  MATH  Google Scholar 

  5. Yu. I. Kifer: Optimal stopped games, Theor.Prob.Appl. 16 (1971), 185–189.

    Article  MATH  Google Scholar 

  6. N. V. Krylov: Control of Markov processes and W-spaces, Math.USSR-Izv. 5 (1971), 233–266.

    Article  MATH  Google Scholar 

  7. J. P. Lepeltier and M. A. Maingueneau: Le jeu de Dynkin en theorie generale sans l'hypothese de Mokobodski, Stochastics 13 (1984), 25–44.

    Article  MathSciNet  MATH  Google Scholar 

  8. H. Morimoto: Dynkin games and martingale methods, Stochastics 13 (1984), 213–228.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Neveu: Discrete-Parameter Martingales, North-Holland, Amsterdom (1975).

    MATH  Google Scholar 

  10. Y. Ohtsubo: Optimal stopping in sequential games with or without a constraint of always terminating, to appear in Math.Oper.Res. (1986).

    Google Scholar 

  11. Y. Ohtsubo: The Dynkin stopping with a finite constraint and bisequential decision problems, Mem.Fac.Sci., Kochi Univ., Ser.A 7 (1986), 59–69.

    MathSciNet  MATH  Google Scholar 

  12. Y. Ohtsubo: Neveu's martingale conditions and closedness in Dynkin stopping problem with a finite constraint, Stochastic Process.Appl. 22 (1986), 333–342.

    Article  MathSciNet  MATH  Google Scholar 

  13. Ł. Stettner: On closedness of general zero-sum stopping game, Bull.Polish Acad.Sci.Math. 32 (1984), 351–361.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Kochi University, 2-5-1 Akebono-cho, 780, Kochi, Japan

    Yoshio Ohtsubo

Authors
  1. Yoshio Ohtsubo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shinzo Watanabe Jurii Vasilievich Prokhorov

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Ohtsubo, Y. (1988). On Dynkin's stopping problem with a finite constraint. In: Watanabe, S., Prokhorov, J.V. (eds) Probability Theory and Mathematical Statistics. Lecture Notes in Mathematics, vol 1299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0078495

Download citation

  • DOI: https://doi.org/10.1007/BFb0078495

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18814-8

  • Online ISBN: 978-3-540-48187-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation