Celebratio Mathematica

David H. Blackwell

⇧

Students

Howard Tucker :Contributions to the mathematical theory of accident proneness with particular reference to multiple exposure University of California, Berkeley, Ph.D. 1955
Arnold Samuel Shapiro :Some conditions for the existence of similar regions University of California, Berkeley, Ph.D. 1956
Aram John Thomasian :On the magnitude of the sum of error probabilities University of California, Berkeley, Ph.D. 1956
Mohamed Ahmed :On a locally most powerful similar test for the independence of two Poisson variables University of California, Berkeley, Ph.D. 1958
Edgar Gilbert :The identifiability problem for functions of a finite Markov chain University of California, Berkeley, Ph.D. 1958
Lambert Koopmans :Asymptotic rate of discrimination for Markov processes University of California, Berkeley, Ph.D. 1958
Martin Fox :Some zero-sum two-person games with moves in the unit interval University of California, Berkeley, Ph.D. 1959
Richard Isaac :Probability University of California, Berkeley, Ph.D. 1959
Melvin Katz, Jr. :Infinitely repeatable games University of California, Berkeley, Ph.D. 1959
John Birch :Approximations for the entropy for functions of Markov chains University of California, Berkeley, Ph.D. 1960
Beliyar Bhat :Bayes sequential tests in Markov chains University of California, Berkeley, Ph.D. 1961
Morton Davis :Infinite games with perfect information University of California, Berkeley, Ph.D. 1961
Dorian Feldman :Contributions to the “two-armed bandit” problem University of California, Berkeley, Ph.D. 1961
Benton Jamison :On the ergodic theory of Markov operators University of California, Berkeley, Ph.D. 1961
Atholl Wilson :An approach to n-person games University of California, Berkeley, Ph.D. 1961
Jack Karush :A martingale proof of the Ergodic Theorem using random averages University of California, Berkeley, Ph.D. 1962
Gerald Smith, Jr. :Problems concerning countable-state, continuous-time, stationary Markov processes with instantaneous states University of California, Berkeley, Ph.D. 1962
Barry Brown :Dynamic programming in finite-state discrete-time Markov chains University of California, Berkeley, Ph.D. 1963
Richard Bucy :Recurrent events for Markov chains University of California, Berkeley, Ph.D. 1963
Jaap Fabius :Asymptotic behavior of Bayes’ estimates University of California, Berkeley, Ph.D. 1963
Ashok Maitra :Dynamic programming for countable state systems University of California, Berkeley, Ph.D. 1963
Roger Alexander Purves :Bimeasurable functions University of California, Berkeley, Ph.D. 1963
Richard Robinson :A set-theoretical approach to empirical meaningfulness of measurement statements University of California, Berkeley, Ph.D. 1963
Aharon Yahav :On optimal stopping University of California, Berkeley, Ph.D. 1963
Howard Dachslager :On sums of two-valued functions of special type University of California, Berkeley, Ph.D. 1964
George Gregory Roussas :Some extensions of Dubins’ and savage’s work on Red and Black University of California, Berkeley, Ph.D. 1964
Rolando Chuaqui :A definition of probability based on equal likelihood University of California, Berkeley, Ph.D. 1965
Phillip Freygood :Limiting conditional behaviour of some transient chains University of California, Berkeley, Ph.D. 1965
Ralph Eugene Strauch :Negative dynamic programming University of California, Berkeley, Ph.D. 1965
Roger J-B Wets :Programming under uncertainty University of California, Berkeley, Ph.D. 1965
Carlos Barbosa-Dantas :The existence of stationary optimal plans University of California, Berkeley, Ph.D. 1966
Jeremy Berman :Marginal distributions and product densities University of California, Berkeley, Ph.D. 1966
Benjamin Eichhorn :Sequential-search problems University of California, Berkeley, Ph.D. 1966
Nadia Girgis :Optimal cash balance levels University of California, Berkeley, Ph.D. 1966
David Matula :Games of sequence-prediction University of California, Berkeley, Ph.D. 1966
John Rolph :Bayesian estimation of mixing distributions University of California, Berkeley, Ph.D. 1966
Manish C. Bhattacharjee :Optimal random walk via dynamic programming University of California, Berkeley, Ph.D. 1967
Tien-Fang Hou :Weak approachability in a two-person game University of California, Berkeley, Ph.D. 1967
Alberto Ruiz-Moncayo :Optimal stopping for functions of Markov chains University of California, Berkeley, Ph.D. 1967
Calvin Sweat :Adaptive competitive decision in repeated play of a matrix game with uncertain entries University of California, Berkeley, Ph.D. 1967
Isaac Meilijson :A bargaining problem University of California, Berkeley, Ph.D. 1969
Sailes Sengupta :The two-armed bandit problem with finite memory University of California, Berkeley, Ph.D. 1969
James Flynn :Linear production systems with incentives: A dynamic-programming approach University of California, Berkeley, Ph.D. 1970
Abdelaziz Laghrari :Estimation with crude measurements University of California, Berkeley, Ph.D. 1970
Michael Lawrence Orkin :Infinite games with simultaneous moves University of California, Berkeley, Ph.D. 1970
Marie-Louise Yengoyan :Optimum Bayesian allocation in sampling University of California, Berkeley, Ph.D. 1970
Hezekiah Adeyemi :Capacity regions for two-way channels University of California, Berkeley, Ph.D. 1971
Mustafa Benyakief :Statistical Invariance Under Groups and Optimum Procedures University of California, Berkeley, Ph.D. 1971
Kang ling James :On two-move prediction games University of California, Berkeley, Ph.D. 1971
Siew-Tin Koay :On the tail behavior of some classes of distribution functions University of California, Berkeley, Ph.D. 1971
John Morgan, II :Infinite games and singular sets University of California, Berkeley, Ph.D. 1971
Lawrence Myers :An N-move prediction game University of California, Berkeley, Ph.D. 1971
Richard Kakigi :Following a two-state Markov chain with incomplete information University of California, Berkeley, Ph.D. 1972
Abderrahmane Alj :Asymptotic value of repeated games University of California, Berkeley, Ph.D. 1973
Li-Pei Chen :Unsymmetric two-move lag-evasion games University of California, Berkeley, Ph.D. 1974
Arne Wagner :A one-dimensional infinite particle system University of California, Berkeley, Ph.D. 1974
Tadeusz Bednarski :Minimax procedures and capacities University of California, Berkeley, Ph.D. 1976
Richard Persons :On the strict determination of hypothesis-testing games University of California, Berkeley, Ph.D. 1976
Flavio Gorini :Win-lose Blotto games University of California, Berkeley, Ph.D. 1978
Jonathan Nkwuo :Randomized response model with more than two choices University of California, Berkeley, Ph.D. 1978
Shaiy Pilpel :Decreasing subsequences of random permutations University of California, Berkeley, Ph.D. 1978
Wesley Thompson :A comparison of the mean and the median University of California, Berkeley, Ph.D. 1978
Richard Lockhart :The programming operation on sigma fields University of California, Berkeley, Ph.D. 1979
Basudev Uprety :Bayesian tests of some sharp-null hypotheses about normal distributions University of California, Berkeley, Ph.D. 1979
Kooros Mahjoob-Behrooz :The unobserved variables in simultaneous equations systems University of California, Berkeley, Ph.D. 1981
Robert Nau :Coherent assessment of subjective probability University of California, Berkeley, Ph.D. 1981