Share feedback directly with Fabric product managers, participate in targeted research studies and influence the Fabric roadmap.
Sign up nowGet Fabric certified for FREE! Don't miss your chance! Learn more
Hi - I am trying to use power query to create the most optimal matches in a dataset. Think of it as the college dorm assigment problem. I have survey responses from a group of people and I want to match individuals with the most opposite responses. The issue is rather than create a unique score for each person, the individual's responses are compared to every other person to create a score for every possible pairing. I have been able to create a matrix with the participants on the X and Y axis and their pairing score. Now I need to select the pairings with the highest scores, without any of the participants being selected more than once.
After some digging, it appears to be a perfect use case for the hungarian aglorithm, does anyone know how to do this in Power Query, or maybe have the Python code to do it?
Thanks in advance
Solved! Go to Solution.
Hi @Anonymous ,
About Hungarian Algorithm in python, I think you could refer these two simliar articles which introduce it in details:
Best Regards,
Community Support Team _ Yingjie Li
If this post helps, then please consider Accept it as the solution to help the other members find it more quickly.
Hi @Anonymous ,
About Hungarian Algorithm in python, I think you could refer these two simliar articles which introduce it in details:
Best Regards,
Community Support Team _ Yingjie Li
If this post helps, then please consider Accept it as the solution to help the other members find it more quickly.
Share feedback directly with Fabric product managers, participate in targeted research studies and influence the Fabric roadmap.
If you love stickers, then you will definitely want to check out our Community Sticker Challenge!
Check out the January 2026 Power BI update to learn about new features.
| User | Count |
|---|---|
| 7 | |
| 4 | |
| 4 | |
| 4 | |
| 3 |
| User | Count |
|---|---|
| 12 | |
| 11 | |
| 11 | |
| 7 | |
| 6 |