Optimizing Satisfaction in Group Formation
Some Olin students have a strong preferences for teammates when it comes to class projects. Could we collect this data and then optimize the number of preferences met? Once enough people get involved, the problem turns out to be a satisfiability problem; it's NP Complete, so approximations must be made to deliver a good solution in a reasonable amount of time. We developed and tested a number of approximations in our project, and then took those approximations back to our classmates who told us how we did.
One of the visitors to my Expo presentation said that he'd like to use the system to figure out tables at a wedding, and a professor was interested in using it in class, so this may be something I give more attention to later.
Team: Grant Hutchins
Resources: Class Presentation
, Exposition Presentation , Paper 