Optimal solution to the multinomial selection problem for two alternatives. Issue 3 (3rd July 2017)

• Record Type: Journal Article
• Authors: Tankayev, Timur; Tovey, Craig
• Is Part Of: Sequential analysis. Volume 36:Issue 3(2017)
• Page Start: 415
• Page End: 432
• Publication Date: 2017-07-03
• Subjects: Least favorable configuration -- linear programming -- multinomial -- selection -- Slippage; 62L15 -- 60G40 -- 90C05 -- 62F07; Sequential analysis -- Periodicals; 519.54
• DOI: 10.1080/07474946.2017.1360093
• Languages: English
• ISSNs: 0747-4946

Abstract

ABSTRACT: The 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.