return

Celebratio Mathematica

David H. Blackwell

Statistics  ·  UC Berkeley

Game theory

[1]R. Bell­man and D. Black­well: “Some two-per­son games in­volving bluff­ing,” Proc. Nat. Acad. Sci. U. S. A. 35 : 10 (October 1949), pp. 600–​605. MR 0031700 Zbl 0041.​44805 article

[2]D. Black­well: “On ran­dom­iz­a­tion in stat­ist­ic­al games with \( k \) ter­min­al ac­tions,” pp. 183–​187 in Con­tri­bu­tions to the the­ory of games, vol. II. Edi­ted by H. W. Kuhn and A. W. Tuck­er. An­nals of Math­em­at­ics Stud­ies 28. Prin­ceton Uni­versity Press, 1953. MR 0054923 Zbl 0050.​14801 incollection

[3]K. J. Ar­row, E. W. Barankin, and D. Black­well: “Ad­miss­ible points of con­vex sets,” pp. 87–​91 in Con­tri­bu­tions to the the­ory of games, vol. II. Edi­ted by H. W. Kuhn and A. W. Tuck­er. An­nals of Math­em­at­ics Stud­ies 28. Prin­ceton Uni­versity Press, 1953. MR 0054919 Zbl 0050.​14203 incollection

[4]N. M. Smith, Jr., S. S. Wal­ters, F. C. Brooks, and D. H. Black­well: “The the­ory of value and the sci­ence of de­cision: A sum­mary,” J. Op­er­a­tions Res. Soc. Amer. 1 : 3 (May 1953), pp. 103–​113. MR 0053466 article

[5]D. Black­well: “On multi-com­pon­ent at­tri­tion games,” Nav­al Res. Lo­gist. Quart. 1 : 3 (1954), pp. 210–​216. MR 0068195 article

[6]D. Black­well: “Con­trolled ran­dom walks,” pp. 336–​338 in Pro­ceed­ings of the In­ter­na­tion­al Con­gress of Math­em­aticians (Am­s­ter­dam, 2 Septem­ber–9 Septem­ber 1954), vol. III. Wiskun­dig Gen­ootschap. E. P. Noord­hoff (Gronin­gen), 1956. MR 0085141 Zbl 0073.​13204 incollection

[7]D. Black­well: “An ana­log of the min­im­ax the­or­em for vec­tor pay­offs,” Pa­cific J. Math. 6 : 1 (1956), pp. 1–​8. MR 0081804 Zbl 0074.​34403 article

[8]D. Black­well: “Min­im­ax and ir­re­du­cible matrices,” J. Math. Anal. Ap­pl. 3 : 1 (August 1961), pp. 37–​39. MR 0139495 Zbl 0111.​33404 article

[9]D. Black­well: “In­fin­ite games and ana­lyt­ic sets,” Proc. Nat. Acad. Sci. U.S.A. 58 : 5 (November 1967), pp. 1836–​1837. MR 0221466 Zbl 0224.​90077 article

[10]D. Black­well and T. S. Fer­guson: “The big match,” Ann. Math. Stat. 39 (1968), pp. 159–​163. MR 0223162 Zbl 0164.​50305 article

[11]D. Black­well: “In­fin­ite \( G_{\delta} \)-games with im­per­fect in­form­a­tion,” Za­s­tos. Mat. 10 (1969), pp. 99–​101. MR 0243837 Zbl 0232.​90068 article

[12]D. Black­well: “Borel sets via games,” Ann. Probab. 9 : 2 (1981), pp. 321–​322. MR 606995 Zbl 0455.​28002 article

[13]D. Black­well: “Op­er­at­or solu­tion of in­fin­ite \( G_\delta \) games of im­per­fect in­form­a­tion,” pp. 83–​87 in Prob­ab­il­ity, stat­ist­ics, and math­em­at­ics: Pa­pers in hon­or of Samuel Karlin. Edi­ted by T. W. An­der­son, K. B. Ath­reya, and D. L. Ig­le­hart. Aca­dem­ic Press (Bo­ston, MA), 1989. MR 1031279 Zbl 0696.​90094 incollection

[14]D. Black­well: “Games with in­fin­itely many moves and slightly im­per­fect in­form­a­tion,” pp. 407–​408 in Games of no chance (MSRI, Berke­ley, CA 11–21 Ju­ly 1994). Edi­ted by R. J. Nowakowski. MSRI Pub­lic­a­tions 29. Cam­bridge Uni­versity Press, 1996. Zbl 0873.​90115 incollection

[15]D. Black­well: “The square-root game,” pp. 35–​37 in Game the­ory, op­tim­al stop­ping, prob­ab­il­ity and stat­ist­ics: Pa­pers in hon­or of Thomas S. Fer­guson. Edi­ted by F. T. Bruss and L. Le Cam. IMS Lec­ture Notes–Mono­graph Series 35. In­sti­tute of Math­em­at­ic­al Stat­ististis (Beach­wood, OH), 2000. MR 1833849 Zbl 0988.​91004 incollection

[16]D. Black­well: “The pre­dic­tion of se­quences,” In­ter­nat. J. Game The­ory 31 : 2 (2002), pp. 245–​251. Spe­cial an­niversary is­sue. MR 1968990 Zbl 1082.​91036 article