implemented "Ranked Pairs" algorithm for merging rankings from different users #7
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
rankings from different users
|
thank you! could you add numpy to backend/requirements.txt ? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is an implementation of "Ranked Pairs" (or Tideman's method) for merging different preference structures.
There are many impossibility results of how you can merge different preference structures, like Arrow's impossibility theorem that show that mergings can never be unilaterally perfect.
However, for the properties we need, Ranked Pairs seems to be optimal, since the drawbacks it does have don't apply to us.
One downside is the rather high computational overhead of ~O(n^3), but I think we are not going to have too many votes per prompt, making this not that big of an issue for us (we don't need to rank between different prompts).