Time: 3:30pm to 4:00pm
Venue: Room 7-208, 7/F, Lau Ming Wai Academic Building
Many classical sequential procedures model the partial sum difference process between two competing alternatives as a Brownian motion process. In this paper, the marginal probability of eliminating the best alternative is considered while modeling the partial sum difference process. We adaptively allocate the total amount of the probability of incorrect selection to every time point where the comparisons between alternatives are conducted and set the continuation regions to ensure the marginal probability of eliminating the best alternative does not exceed the probability assigned to each time point . We show by examples that under our framework, the procedure can be easily developed for both indifference-zone (IZ) and IZ free formulations.
Mr Ying Zhong is a third-year PhD student in the Department of Management Sciences at City University of Hong Kong. He holds a Master Degree of Applied Statistics from University of Michigan, Ann Arbor and a Bachelor Degree of Computing Mathematics from City University of Hong Kong. His research interests lie primarily on the ranking-and- selection problem and the multi armed bandit problem.