Pacific Journal of Mathematics

Weak approximation of strategies in measurable gambling.

Victor C. Pestien

Article information

Pacific J. Math., Volume 109, Number 1 (1983), 157-164.

First available in Project Euclid: 8 December 2004

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60G40: Stopping times; optimal stopping problems; gambling theory [See also 62L15, 91A60]
Secondary: 90C40: Markov and semi-Markov decision processes


Pestien, Victor C. Weak approximation of strategies in measurable gambling. Pacific J. Math. 109 (1983), no. 1, 157--164.

Export citation


  • [1] Dimitri P. Bertsekas, and Steven E. Shreve, Stochastic Optimal Control: the Discrete Time Case, Academic Press, New York (1978).
  • [2] Lester E. Dubins, On Lebesgue-like extensions of finitely additive measures, Ann. Probability, 3 (1974), 456-463.
  • [3] Lester E. Dubins, and Leonard J. Savage, Inequalities for Stochastic Processes: How to Gamble if You Must, Dover, New York (1965, 1976).
  • [4] Lester E. Dubins and E. H. Spanier, How to cut a cake fairly, Amer. Math. Monthly, 68(1961),1-17.
  • [5] Lester E. Dubins, and William D. Sudderth, Countably additive gambling and optimal stopping, Z. Wahrscheinlichkeitstheorie verw. Gebiete, 41 (1977), 59-72.
  • [6] Victor C. Pestien, Stopping-time-indexed convergence and measurable gambling. The- sis, (1980), Department of Mathematics, University of California, Berkeley.
  • [7] Roger A. Purves, and William D. Sudderth, Some finitely additive probability, Ann. Probability, 4 (1976), 259-276.
  • [8] Roger A. Purves, How to stay in a set or Knig's lemma for random paths, Israel J. Math., 43 (1982), 139-153.
  • [9] Ralph E. Stauch, Measurable gambling houses, Trans. Amer. Math. Soc, 126 (1976), 64-72. (correction 130, 184).
  • [10] William D. Sudderth, On measurable gambling problems, Ann. Math. Statist., 42 (1971), 260-269.