Dynamic Programming For Stopping

Dynamic Programming for Stopping is a mathematical framework within optimal stopping theory that uses recursive value iteration to determine the optimal time to terminate a stochastic process by balancing immediate rewards against expected future outcomes.

34

Publications

1.9K

Citations

70

Authors

43

Institutions

Publications per year

2017–2026

3

Authors

70

  1. CL
    C. L. Mallows

    AT&T (United States), United States

    2 publications · 226 citations

    2

    h-index

  2. SR
    Siddhartha R. Dalal

    RAND Corporation, United States

    2 publications · 226 citations

    2

    h-index

  3. SM
    Sheldon M. Ross

    University of California, Berkeley, United States

    2 publications · 63 citations

    2

    h-index

  4. KS
    Krzysztof Szajowski

    Wrocław University of Science and Technology, Poland

    2 publications · 40 citations

    2

    h-index

  5. AK
    Anna Karpowicz

    Institute of Mathematics, Poland

    2 publications · 40 citations

    2

    h-index

1–5 of 70

Venues

  1. Stochastics

    3 publications · 101 citations

    3

    h-index

  2. SIAM Journal on Control and Optimization

    2 publications · 41 citations

    2

    h-index

  3. Insurance Mathematics and Economics

    2 publications · 31 citations

    2

    h-index

  4. 2

    h-index

  5. Advances in Applied Probability

    AAP · 2 publications · 63 citations

    2

    h-index

1–5