SM – Stable Marriage Algorithm

The problem statement, if we have N men and M women to be married. How to marry them? in the conditions that, (1) global marriage is stable, (2) everyone is satisfy with her or his partner, and (3) the fairness on their sex need to be respected. This is one of the most popular combinatorial problems that were firstly studied by Gale and Shapley in 1962.


We proposed a familly of algorithms (OZ, BZ, RZ, RGS, S-fasion) based on a novel representation, so-called the marriage table, to solve this problem.



  • M. Zavidovique, N. Suvonvorn, (2007), Table-turning to Stable Marriage Satisfaction and Equity, In Proceedings of IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing, September 10-12, 2007, Bucharest, Romania, vol. 1, p. 179-184.
  • N. Suvonvorn and B. Zavidovique, (2006), A Stable Marriages Algorithm to Optimize Satisfaction and Equity, In Proceedings of International Conference on Image Analysis and Recognition (ICIAR), September 18-20, 2006, Povoa de Varzim, Portugal, vol. 2, pp. 422-433.
  • B. Zavidovique, N. Suvonvorn and Guna S. Seetharaman, (2005), A Novel representation and algorithms for (quasi) stable marriages, In Proceedings of International Conference on Informatics in Control, Automation and Robotics (ICINCO), September 14-17, 2005, Barcelona, Spain, p. 63-70.
  • N. Suvonvorn, (2005), Novel algorithms of stable marriages problem,In Proceedings of the First Academic Conference of Thai Students in France and Europe, organized by the Association of Thai Students in France under royal patronage of Thailand, June 14, 2005, Paris, France.

Related posts: