How to stay in a set or Koenig's lemma for random paths

DOI10.1007/BF02761725zbMath0502.90100WikidataQ124999336 ScholiaQ124999336MaRDI QIDQ1173031

William D. Sudderth, Roger A. Purves

Publication date: 1982

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

finitenessmeasurabilityKoenig's lemmarandom paths

Mathematics Subject Classification ID

Game theory (91A99) Dynamic programming (90C39) Inference from stochastic processes (62M99) Markov and semi-Markov decision processes (90C40)

Related Items (2)

Finitely additive and measurable stochastic games ⋮ A notion of conditional probability and some of its consequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The optimal reward operator in dynamic programming
• Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
• Some finitely additive probability
• On stationary strategies for absolutely continuous houses
• On Lebesgue-like extensions of finitely additive measures
• Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
• Countably additive gambling and optimal stopping
• Universally Measurable Policies in Dynamic Programming
• Measurable Gambling Houses

This page was built for publication: How to stay in a set or Koenig's lemma for random paths