Maximizing group happiness in White Elephants using the Hungarian optimal assign...
source link: https://www.tuicool.com/articles/Zvy2Ija
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Learn about the Hungarian (Munkres) optimal assignment algorithm with Python code to maximize group over individual preferences.
Jul 14 ·8min read
If you ever participated in a White Elephant around Christmas, you’ve probably felt the anxiety of ending up with a present that you don’t want. The problem is that some people go home with presents they actually like while others might go home with ones they don’t want, even if they might be more valuable to someone else! After going through several White Elephants ending up with presents no where near the top of my list, I had to wonder if there would be a better way to distribute the presents so that the satisfaction of the group was maximized instead of the satisfaction of few lucky individuals. That is, you may not get your top choice present but nevertheless the groups as a whole would be happier so that there would be another White Elephant the next year. Not surprisingly, there was an efficient graph theory algorithm designed to solve exactly this problem.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK