bnavetta / mun-website

0 stars 0 forks source link

Position Assignment Algorithm #4

Open bnavetta opened 7 years ago

bnavetta commented 7 years ago

Once schools have been accepted and allocated a number of delegates, figure out which positions each school should get. This should be consistent where possible (ex. one school has all the France slots) and take into consideration school preferences/priority.

  1. School given x delegates (out of however many requested)
  2. We have n positions (sum of all x = n)
  3. Weighted by committee + country preferences, how much MUN likes the school, give each school its x positions
    1. rank schools
    2. iterating through schools
      1. assign all positions with country = 1st choice to school
        1. as many as possible (school might not be able to fill a country)
      2. once 1st choice country taken, switch to 2nd, and so on
    3. randomly assign remaining countries to schools as needed
      1. weight by importance of country (soft power)
  4. School then assigns a delegate to each position
  5. Can manually assign later
  6. Will probably have more positions than delegates
  7. won't work for specialized / crisis committees
    1. not really overlap in committees
    2. just need to take into account what percentage breakdown they put
  8. giving schools countries comes after giving them general/spec/crisis
    1. assign to spec/crisis randomly
    2. assign to general based on algorithm above
  9. schools can only see what they've been given once we say so
bnavetta commented 7 years ago

Automated position assignment