Question 23
Consider a tournament with $n$ participants, where $n = 2m - 1$ and $m \ge 1$. This tournament has no draws, and each pair of students plays against each other exactly once. The students are listed based on their number of wins, with those having an equal number of wins being listed alphabetically. What is the maximum number of wins that the $m$-th student can achieve in this scenario?