Abstract
ABSTRACTThe multinomial selection problem is to find a stopping policy for repeated independent trials, each of which reports a winner among competing alternatives that has low expected cost and high probability of correct selection (PCS) of the best alternative. In 1959, Bechhofer, Elmaghraby, and Morse formulated the problem as minimizing the worst-case expected number of trials, subject to a lower bound on PCS and upper bound on the maximum number of trials, over all probability vectors outside an indifference zone. For the case of two alternatives, we prove that if one employs a particular probability vector known as the slippage configuration, then a linear program always finds an optimal stopping policy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
