CSC/ECE 517 Spring 2019 - Project E1928. Allow reviewers to bid on what to review: Difference between revisions
| Line 30: | Line 30: | ||
The first number of each pair in the matrix gives the ranking of women by the men, the second number is the ranking of the men by the women. Thus, α ranks A first, B second, C third, while A ranks β first, γ second, and α third, etc. | The first number of each pair in the matrix gives the ranking of women by the men, the second number is the ranking of the men by the women. Thus, α ranks A first, B second, C third, while A ranks β first, γ second, and α third, etc. | ||
In the existing implementation, we have match_new_teams_to_topics method in lottery_controller that performs this stable sorting algorithm for teams that have bid for an assignment. Our objective would be to implement a similar strategy, but we would use students instead of teams since there are no "team reviews". Every student selects their own assignment to review | |||
== Design strategy == | == Design strategy == | ||
== References == | == References == | ||
Revision as of 23:37, 5 April 2019
About Expertiza
Expertiza is a web application through which students can submit and peer-review learning objects (articles, code, web sites, etc). The Expertiza project is supported by the National Science Foundation. It is used in select courses at NC State and by professors at several other colleges and universities.
Stable marriage problem
As part of this assignment, we have to implement the stable marriage problem which is a stable sorting algorithm. The term "stable" here means that each student will be assigned to the the review topics for which they have the most priority.
Definition: An assignment of couples will be called unstable if there are two men α and β who are married to women A and B, respectively, although β prefers A to B and A prefers β to α.
A certain community consists of n men and n women. Each person ranks those of the opposite sex in accordance with his or her preferences for a marriage partner. We seek a satisfactory way of marrying off all members of the community. Imitating our earlier definition, we call a set of marriages unstable (and here the suitability of the term is quite clear) if under it there are a man and a woman who are not married to each other but prefer each other to their actual mates.
So, we can ask the question: For any pattern of preferences is it possible to find a stable set of marriages?
Before giving the answer let us look at some examples.
Example 1. The following is the “ranking matrix” of three men, α, β, and γ , and three women, A, B, and C.
| Man\Woman | A | B | C |
|---|---|---|---|
| α | 1,3 | 2,2 | 3,1 |
| β | 3,1 | 1,3 | 2,2 |
| γ | 2,2 | 3,1 | 1,3 |
The first number of each pair in the matrix gives the ranking of women by the men, the second number is the ranking of the men by the women. Thus, α ranks A first, B second, C third, while A ranks β first, γ second, and α third, etc.
In the existing implementation, we have match_new_teams_to_topics method in lottery_controller that performs this stable sorting algorithm for teams that have bid for an assignment. Our objective would be to implement a similar strategy, but we would use students instead of teams since there are no "team reviews". Every student selects their own assignment to review