Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites

  • Bhatnagar, Aniket (Dept. of Computer Science Engineering and IT, Jaypee Institute of Information Technology) ;
  • Gambhir, Varun (Dept. of Computer Science Engineering and IT, Jaypee Institute of Information Technology) ;
  • Thakur, Manish Kumar (Dept. of Computer Science Engineering and IT, Jaypee Institute of Information Technology)
  • Received : 2017.12.26
  • Accepted : 2018.05.12
  • Published : 2018.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

Keywords

References

  1. D. Gale, "The two-sided matching problem: origin, development and current issues," International Game Theory Review, vol. 3, no. 2-3, pp. 237-252, 2001. https://doi.org/10.1142/S0219198901000373
  2. D. F. Manlove and G. O'Malley, "Student-project allocation with preferences over projects," Journal of Discrete Algorithms, vol. 6, no. 4, pp. 553-560, 2008. https://doi.org/10.1016/j.jda.2008.07.003
  3. J. Wu, "Stable matching beyond bipartite graphs," in Proceedings of 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, Chicago, IL, 2016, pp. 480-488.
  4. D. Gale and L. S. Shapley, "College admissions and the stability of marriage," The American Mathematical Monthly, vol. 69, no. 1, pp. 9-15, 1962. https://doi.org/10.1080/00029890.1962.11989827
  5. D. G. McVitie and L. B. Wilson, "The stable marriage problem," Communications of the ACM, vol. 14, no. 7, pp. 486-490, 1971. https://doi.org/10.1145/362619.362631
  6. R. W. Irving, P. Leather, and D. Gusfield, "An efficient algorithm for the "optimal" stable marriage," Journal of the ACM, vol. 34, no. 3, pp. 532-543, 1987. https://doi.org/10.1145/28869.28871
  7. I. Damianidis, "The stable marriage problem: optimizing different criteria using genetic algorithms," Master's thesis, University of Boras, Sweden, 2011
  8. K. Iwama and S. Miyazaki, "A survey of the stable marriage problem and its variants," in Proceedings of International Conference on Informatics Education and Research for Knowledge-Circulating Society, Kyoto, Japan, 2008, pp. 131-136.
  9. M. S. Pini, F. Rossi, B. Venable, and T. Walsh, "Stable marriage problems with quantitative preferencesm" 2010 [Online]. Available: https://arxiv.org/abs/1007.5120.
  10. M. Baiou and M. Balinski, "Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)," Discrete Applied Mathematics, vol. 101, no. 1-3, pp. 1-12, 2000. https://doi.org/10.1016/S0166-218X(99)00203-6
  11. I. Bello and S. Lianshuan, "Genetic algorithm for the stable marriage problem (SMP)," International Journal of Science and Research, vol. 5, no. 6, pp. 939-944, 2016.
  12. M. S. Pini, F. Rossi, K. B. Venable, and T. Walsh, "Stability, optimality and manipulation in matching problems with weighted preferences," Algorithms, vol. 6, no. 4, pp. 782-804, 2013. https://doi.org/10.3390/a6040782
  13. Membership option of BharatMatrimony [Online]. Available: http://www.bharatmatrimony.com/payments/paymentoptions.php
  14. A. L. Corcoran and R. L. Wainwright, "Using LibGA to develop genetic algorithms for solving combinatorial optimization problems," Practical Handbook of Genetic Algorithms. Boca Laton, FL: CRC Press, 1995, pp. 143-172.
  15. A. Banks, J. Vincent, and C. Anyakoha, "A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications," Natural Computing, vol. 7, no. 1, pp. 109-124, 2008. https://doi.org/10.1007/s11047-007-9050-z
  16. Category:Stable sorts [Online]. Available: https://en.wikipedia.org/wiki/Category:Stable_sorts.