Optimal stopping with a probabilistic constraint (Q1695821): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4032143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal routing for maximizing the travel time reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Investment Policies for a Firm With a Random Risk Process: Exponential Utility and Minimizing the Probability of Ruin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Dynamic Programming and Probabilistic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neuro-Dynamic Programming: An Overview and Recent Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness of stopping times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic maximum principle for the optimization of recursive utilities under constraints. / rank
 
Normal rank

Revision as of 02:07, 15 July 2024

scientific article
Language Label Description Also known as
English
Optimal stopping with a probabilistic constraint
scientific article

    Statements

    Identifiers

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