bujsa kyoudai matching algorithm

Check spring-2025 branch for updated algorithm, and translated into python: big_little_matching.cpp, with matching being already compiled executable.

INSTRUCTIONS FOR USE

Directly upload big and little preference csvs, returning a table of matches from the algorithm. No programming knowledge required, simply save preference forms from google sheets to csv.

Link to website

When uploading the csv, this is incredibly important. Your files MUST look like they do in the examples below.

Bigs Preferences Example

Littles Preferences Example

Important Notes:

• As of now, unmatched littles are automatically assigned to the first listed big, and vice versa, but this does not effect other results
• Besides the above case, two people will not be matched unless they both placed each other on their forms. Because of this, make sure to verify all the results so that they seem reasonable, and match people manually as required.
• The site is only intended for use within the JSA E-Board, if there are issues contact Theo C.

Usage for non-web version (depreceated, follow instructions above):

1. Open /src/match.py
2. Edit .csv file path for bigs and littles, using formatting given by example files found in /misc
3. Run /src/match.py
4. Output should include the following:
   • Number of bigs and littles
   • Array format of bigs in littles (using curly brackets {})
   • Long list of big names, little names, and numbers next to them
   • Copy ONLY the long list of names
5. Edit big_little_matching.cpp littles variable and bigs variable with respective arrays, and edit num_big and num_little with big/littles amounts
6. Compile big_little_matching.cpp
7. Run the compiled file, i.e. ./matching
8. Paste output from python script
9. Matched list should output

Known issues:

• As of now, unmatched littles are automatically assigned to the first listed big, and vice versa, but this does not effect other results

Future plans:

• Checking for unmatched littles and sending a seperate list