Skip to main content
SpringerLink
Log in

Strong laws for a class of path-dependent stochastic processes with applications

  • Section II Stochastic Extremal Problems
  • Conference paper
  • First Online:
Stochastic Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 81))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hill, Bruce M., Lane, David, and Sudderth, William (1980). A Strong Law for Some Generalized Urn Processes. Ann. Prob., 214–216.

    Google Scholar 

  2. Blum, J.R. and Brennan, M. (1980). On the Strong Law of Large Numbers for Dependent Random Variables. Israeli J. Math. 37, 241–245.

    Google Scholar 

  3. Arthur, W.B., Ermoliev, Yu. M., and Kaniovski, Yu. M. (1983). A Generalized Urn Problem and Its Applications. Kibernetika 19, 49–57 (in Russian). Translated in Cybernetics 19, 61–71.

    Google Scholar 

  4. Nevelson, M.B., and Hasminskii, R.Z. (1972). Stochastic Approximation and recursive estimation. American Math. Society Translations of Math. Monographs, Vol. 47. Providence.

    Google Scholar 

  5. Ljung, L. (1978). Strong Convergence of a Stochastic Approximation Algorithm. Annals of Stat. 6, 680–696.

    Google Scholar 

  6. Arthur, W.B. (1983). Competing Technologies and Lock-In By Historical Small Events: The Dynamics of Allocation under Increasing Returns. Committee for Economic Policy Research, Paper No. 43. Stanford Univ.

    Google Scholar 

  7. Hanson, W.A. (1985). Bandwagons and Orphans: Dynamic Pricing of Competing Systems Subject to Decreasing Costs. Ph.D. dissertation. Stanford Univ. Forthcoming.

    Google Scholar 

  8. Arthur, W.B. (1984). Industry Location and the Economies of Agglomeration: Why a Silicon Valley? Stanford Univ., mimeo.

    Google Scholar 

  9. Fabian, V. (1965). Stochastic Approximation of Constrained Minima. In: Transactions of the 4th Prague Conference on Information Theory, Statistical Decision Functions, and Random Processes. Prague.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, 94305, Stanford, CA, USA

    W. Brian Arthur

  2. Glushkov Institute of Cybernetics, Kiev, USSR

    Yu. M. Ermoliev

  3. Glushkov Institute of Cybernetics, Kiev, USSR

    Yu. M. Kaniovski

Authors
  1. W. Brian Arthur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. M. Ermoliev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu. M. Kaniovski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vadim I. Arkin A. Shiraev R. Wets

Rights and permissions

Reprints and permissions

Copyright information

© 1986 International Institute for Applied Systems Analysis

About this paper

Cite this paper

Brian Arthur, W., Ermoliev, Y.M., Kaniovski, Y.M. (1986). Strong laws for a class of path-dependent stochastic processes with applications. In: Arkin, V.I., Shiraev, A., Wets, R. (eds) Stochastic Optimization. Lecture Notes in Control and Information Sciences, vol 81. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0007105

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16659-7

  • Online ISBN: 978-3-540-39841-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation