Celebratio Mathematica

David H. Blackwell

Dynamic programming

Filter the Bibliography List

clear

D. Black­well: “On the func­tion­al equa­tion of dy­nam­ic pro­gram­ming,” J. Math. Anal. Ap­pl. 2 : 2 (April 1961), pp. 273–​276. MR 0126090 Zbl 0096.​35503 article

D. Black­well: “Dis­crete dy­nam­ic pro­gram­ming,” Ann. Math. Stat. 33 : 2 (1962), pp. 719–​726. MR 0149965 Zbl 0133.​12906 article

D. Black­well: “Memory­less strategies in fi­nite-stage dy­nam­ic pro­gram­ming,” Ann. Math. Stat. 35 : 3 (1964), pp. 863–​865. MR 0162642 Zbl 0127.​36406 article

D. Black­well: “Prob­ab­il­ity bounds via dy­nam­ic pro­gram­ming,” pp. 277–​280 in Stochast­ic pro­cesses in math­em­at­ic­al phys­ics and en­gin­eer­ing (New York, 30 April–2 May 1963). Edi­ted by R. E. Bell­man. Pro­ceed­ings of Sym­po­sia in Ap­plied Math­em­at­ics XVI. Amer­ic­an Math­em­at­ic­al So­ci­ety (Provid­ence, RI), 1964. MR 0163347 Zbl 0139.​13804 incollection

D. Black­well: “Dis­coun­ted dy­nam­ic pro­gram­ming,” Ann. Math. Stat. 36 : 1 (1965), pp. 226–​235. MR 0173536 Zbl 0133.​42805 article

D. Black­well: “Pos­it­ive dy­nam­ic pro­gram­ming,” pp. 415–​418 in Pro­ceed­ings of the fifth Berke­ley sym­posi­um on math­em­at­ic­al stat­istist­ics and prob­ab­il­ity (Berke­ley, CA, 21 June–18 Ju­ly 1965), vol. I: The­ory of stat­ist­ics. Edi­ted by L. M. Le Cam and J. Ney­man. Uni­versity of Cali­for­nia Press (Berke­ley and Los Angeles), 1967. MR 0218104 Zbl 0189.​19804 incollection

D. Black­well: “On sta­tion­ary policies,” J. R. Stat. Soc., Ser. C 133 : 1 (1970), pp. 33–​37. With dis­cus­sion. A Rus­si­an trans­la­tion was pub­lished in Math­em­atika 14:2 (1970). MR 0449711 article

D. Black­well, D. Freed­man, and M. Or­kin: “The op­tim­al re­ward op­er­at­or in dy­nam­ic pro­gram­ming,” Ann. Probab. 2 : 5 (1974), pp. 926–​941. MR 0359818 Zbl 0318.​49021 article

D. Black­well: “The stochast­ic pro­cesses of Borel gambling and dy­nam­ic pro­gram­ming,” Ann. Stat­ist. 4 : 2 (1976), pp. 370–​374. MR 0405557 Zbl 0331.​93055 article