matching algorithm.. a question..!!

[blueRoad]

Hello everyone..!

I have a problem in my project, its a web application for collage students, it assigned a graduation projects to students; by offering many projects online,
student login, selects many project he interested in ( he can choose up to six projects),
after that doctor can see names of students who have chosen his project, doctor ranked them from 1-6 ( may less )

i want to match between student's choice and doctor's choice, and get best order.
there is six choices for student, and also six choices for doctor,
and we have many doctors and many students,

the problem is:
when student select a project as 1st choice,
and doctor also select this student as 1st in that project
then it is (1:1) , best match, the student gets the project.

but in the other cases, what should we put first?
(1:3) // doctor select student in 1st, student selects project in 3rd
or (2:2) // student and doctor select 2nd
so, whats come first? (1:3) or (2:2)
there are some other cases.

this is a similar problem: Stable roommates problem
http://en.wikipedia.org/wiki/Stable_roommates_problem









i'll be happy with any anny small suggestions,

Thanxx[/url]

[Tony]

This is an exact problem of http://en.wikipedia.org/wiki/Stable_marriage_problem which was mentioned 3 times in the "stable roommates" variant. The ranking of non 1:1 matches is discussed in "Optimality of the Solution"

[blueRoad]

oh,
yes i have tried on this algorithm, but coz i don't understand it.

do you think if i modify this algorithm.. i'll get a result?

what about the different cases i face here?
cases like:
1:4 or 2:2
2:4 or 3:2

should I divide the algorithm, for each group of cases?

[Tony]

blueRoad @ Fri Jan 28, 2011 4:11 pm wrote:

i don't understand it.

You should study the algorithm to see how and why it works. It takes care of all the cases.

[blueRoad]

thank u,
so i can trust this algorithm, and think more in it..