A Novel representation and algorithms for (quasi) stable marriages

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.


icincoIn this paper, we propose “stable marriages” algorithms based on a novel representation called marriage table. After explaining how properties as global satisfaction, sex equality and stability show in the representation, we define 3 algorithms corresponding to 3 different scans of the marriage table to meet progressively all constraints. The performance is evaluated in front of the population size for 200 instances in each case. That supports qualitative statistic analysis. Two matching examples in image processing are displayed for illustration.

Related posts: