Turkey TST 2008 Q6
Source:
April 2, 2008
combinatorics unsolvedcombinatorics
Problem Statement
There are voters and candidates. Every voter makes a certain arrangement list of all candidates (there is one person in every place ) and votes for the first people in his/her list. The candidates with most votes are selected and say them winners. A poll profile is all of this lists.
If is a candidate, and are two poll profiles. is a\minus{}good for if and only if for every voter; the people which in a worse position than in is also in a worse position than in . We say positive integer is monotone if and only if for every poll profile and every winner for poll profile is also a winner for all a\minus{}good poll profiles. Prove that is monotone if and only if k>\frac{m(n\minus{}1)}{n}.