Summary: The problem of two-sided matching markets is well-studied in computer science and economics, owing to its diverse applications across numerous domains. Since market participants are usually uncertain about their preferences in various online matching platforms, an emerging line of research is dedicated to the online setting where one-side participants (players) learn their unknown preferences through multiple rounds of interactions with the other side (arms). Sankararaman et al. [23] provide an \(\Omega \left( \frac{N \log ( T )}{\Delta^2} + \frac{K \log ( T )}{\Delta} \right)\) regret lower bound for this problem under serial dictatorship assumption, where \(N\) is the number of players, \(K(\geq N)\) is the number of arms, \( \Delta\) is the minimum reward gap across players and arms, and \(T\) is the time horizon. Serial dictatorship assumes arms have the same preferences, which is common in reality when one side participants have a unified evaluation standard. Recently, the work of Kong and Li [10] proposes the ET-GS algorithm and achieves an \(O \left( \frac{K \log ( T )}{\Delta^2} \right)\) regret upper bound, which is the best upper bound attained so far. Nonetheless, a gap between the lower and upper bounds, ranging from \(N\) to \(K\), persists. It remains unclear whether the lower bound or the upper bound needs to be improved. In this paper, we propose a multi-level successive selection algorithm that obtains an \(O \left( \frac{N \log ( T )}{\Delta^2} + \frac{K \log ( T )}{\Delta} \right)\) regret bound when the market satisfies serial dictatorship. To the best of our knowledge, we are the first to propose an algorithm that matches the lower bound in the problem of matching markets with bandits.