I have to organize a tournament with following numbers:
I have a total of 1338 participants from different schools, and we need to distribute the 16 finalist's places as fair as possible.
The students are distributed as follwing:
School and number of participiants a 254 b 211 c 150 d 186 e 158 f 85 g 66 h 105 i 123
Every school gets at least one finalist. How do I distribute the 16 final places to the different school?
Thank you so much for your help!
It seems natural to assign the places roughly proportional to the number of students. Then again, this might easily leave school with $0$ finalists. And we have to deal with rounding. So the next natural thing is to assign $$ \lfloor \alpha n+\beta\rfloor$$ finalists to a school with $n$ students. Remains to pick $\alpha$ and $\beta$. Typically, one fixes one of them and adjusts the other (e.g., by trial and error) until $$ \sum_{i=1}^9\lfloor \alpha n_i+\beta\rfloor =16.$$ Different strategies are possible (and some correspond to vote counting methods commonly in use to distribute parliamentary seats according to vote counts):