
Accession Number : AD0604439
Title : AN OBSTACLECOURSE PROBLEM: I.
Descriptive Note : Technical rept. no. 98,
Corporate Author : STANFORD UNIV CALIF
Personal Author(s) : Kadane,Joseph
Report Date : 30 JUL 1964
Pagination or Media Count : 17
Abstract : An obstacle course is presented in which n obstacles are given, together with the probability of successfully overcoming the i(th) obstacle. A runner is permitted to choose r < or = n (r fixed) obstacles and to order them, so that he maximizes his expected value, on the assumption that once he fails to overcome an obstacle he receives only the points previously earned. The optimal ordering of the chosen r is a simple function of the obstacle parameters. The optimal choice of which r to attempt is more complicated, and three alternative computational procedures are given, together with a proof that each will terminate at the optimal r, and an upper bound on the number of comparisons required for each. (Author)
Descriptors : (*PROBABILITY, STATISTICAL ANALYSIS), (*OPTIMIZATION, PROBABILITY), DECISION THEORY, ALGEBRA, ANALYSIS OF VARIANCE, THEOREMS, CONVEX SETS
Distribution Statement : APPROVED FOR PUBLIC RELEASE