MathDB
Turkey TST 2008 Q6

Source:

April 2, 2008
combinatorics unsolvedcombinatorics

Problem Statement

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