In this playground competition, you’re challenged to build a toy matching algorithm that maximizes happiness by pairing kids with toys they want. In the dataset, each kid has 10 preferences for their gift (from 1000) and Santa has 1000 preferred kids for every gift available. What makes this extra difficult is that 0.4% of the kids are twins, and by their parents’ request, require the same gift.
It finds an optimal solution for the first version (before competition was relaunched on 22-th of December 2017) of the Santa Gift Matching Challenge (https://www.kaggle.com/c/santa-gift-matching) using C# and CPLEX optimizer. The best score is 0.94253901.
Screenshot with LB before relaunch https://github.com/MalyutinS/KaggleSantaGiftMatchingChallenge2017v1/blob/master/Screen%20Shot%202017-12-22%20at%2019.29.36.png
It takes about 15 minutes to solve on Intel® Core™ i7-6700K with 16 GB RAM.
In this playground competition, you’re challenged to build a toy matching algorithm that maximizes happiness by pairing kids with toys they want. In the dataset, each kid has 10 preferences for their gift (from 1000) and Santa has 1000 preferred kids for every gift available. What makes this extra difficult is that 0.4% of the kids are twins, and by their parents’ request, require the same gift.