E-resources
-
Nakamura, M.; Onaga, K.; Kyan, S.; Silva, M.
1995 IEEE International Symposium on Circuits and Systems (ISCAS), 1995, Volume: 1Conference Proceeding
In this paper we consider a sex-fair matching in the stable marriage problem. The sex-fair stable matching defined in this paper has a property that the sum of the partner's rank of each man in his preference list is as close as possible to the sum of the partner's rank of each woman in her preference list. We transform the sex-fair marriage problem into a graph problem which is suitable for a genetic algorithm. We propose a genetic algorithm for the sex-fair stable matching. The transformation into the graph problem makes application of the GA easier and effective. Computer experiments show the effectiveness of the proposed genetic algorithm.
