Tim Finin (finin@cs.umbc.edu)
Wed, 05 Mar 2003 16:39:14 -0500
> the algorithm for the stable marriage problem gives to give a stable
> solution for a "one to one" pairing, as in the case of the boy-girl problem.
> how would the algorithm work for a "many to one" pairing scheme, where for
> example, a graduate school has to take more than one students ?
Good question. I don't know the answer. But, If you search on
the web I am sure you will find variations on the TMA for one-sided
polygamy (e.g., hospitals can be paired with multiple residents, but
each resident can only be assigned to one hospital).
This archive was generated by hypermail 2.0b3 on Wed Mar 05 2003 - 16:39:28 EST