Computer Science Asked by Gomunkul on December 15, 2020
Looking for an algorithm for splitting a list of people (S) into groups (G), |S| <= |G|, more than one person wants to be in a certain group.
Every person has a monotone ranking from highest (most desired) to lowest of all the groups.
Using this list I want to find the "best matching".
"best matching" is when you maximize the "score of the matching".
"score of the matching" is the sum of the group rankings of the people that got matched with the group, i.e. summing the ranking that the people gave to the group which was chosen for them.
I’m also interested in ideas for other "fairness" values for maximization.
If you want to maximize the sum of the scores for each participant, this is an instance of the assignment problem; use the Hungarian algorithm, or any other algorithm for computing a maximum matching.
You might also be interested in stable marriage algorithms, which have a different notion of fairness.
Answered by D.W. on December 15, 2020
3 Asked on February 21, 2021 by always-newbie
1 Asked on February 20, 2021 by saku
1 Asked on February 20, 2021 by rossko_dca
1 Asked on February 17, 2021 by donvitomarco
0 Asked on February 16, 2021 by von-spotz
0 Asked on February 13, 2021 by adam-cole
a star search algorithms euclidean distance graphs shortest path
1 Asked on February 13, 2021 by aviv-barel
5 Asked on February 10, 2021 by gizmo
0 Asked on February 10, 2021 by arthur-b
1 Asked on February 8, 2021 by keith-paton
1 Asked on February 7, 2021 by user3661613
1 Asked on February 6, 2021 by builderthebob00
0 Asked on February 5, 2021 by pookie
1 Asked on February 4, 2021 by retsek680
1 Asked on February 3, 2021 by stark2022
0 Asked on February 1, 2021 by david-grnberger
0 Asked on January 30, 2021 by tzlil
0 Asked on January 29, 2021 by angelic-demonic
Get help from others!
Recent Answers
Recent Questions
© 2022 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP