How to stay in a set or Koenig's lemma for random paths (Q1173031): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124999336, #quickstatements; #temporary_batch_1717957190283
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The optimal reward operator in dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lebesgue-like extensions of finitely additive measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countably additive gambling and optimal stopping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stationary strategies for absolutely continuous houses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5762903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some finitely additive probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Measurable Policies in Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measurable Gambling Houses / rank
 
Normal rank

Latest revision as of 16:45, 13 June 2024

scientific article
Language Label Description Also known as
English
How to stay in a set or Koenig's lemma for random paths
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references