Discrete Mathematics · 1998 · 38 citations · 7 references
Order TheoryTree LanguageEngineeringGraph TheoryCombinatorial ProblemBusinessComputational ComplexitySecretary ProblemTree AutomatonComputer ScienceDiscrete MathematicsPartially Ordered SetCombinatorial OptimizationMechanism Design
7
Great Expectations: The Theory of Optimal Stopping.
Michael Orkin, Y. S. Chow, Herbert Robbins et al. · Journal of the American Statistical Association · 1975 · 711 citations
Who Solved the Secretary Problem?
Thomas S. Ferguson · Statistical Science · 1989 · 684 citations · Full text
Mathematical Programming, Engineering, Computational Social Choice +21