A NOVEL REPRESENTATION AND ALGORITHMS FOR (QUASI) STABLE MARRIAGES

B. Y. Zavidovique, N. Suvonvorn, Guna S. Seetharaman

Abstract

In 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.

References

  1. Abeledo, H. and Rothblum, U. G. (1995). Paths to marriage stability. Elsevier : Discrete Applied Mathematics, 63(1-12).
  2. Ballester, C., Castan, E., Gonzalez, M., and Morel, J. (1998). Contrast invariant image intersection. C.M.L.A, (9817).
  3. Caselles, V., Coll, B., and Morel, J. (1999). Topographic maps and local contrast changes in natural images. International Journal of Computer Vision, 33(1):5-27.
  4. Lisani, Monasse, P., and Rudin, L. (2001). Fast shape extraction and applications. C.M.L.A, (2001-16).
  5. K. Iwama, D. Manlove, S. M. and Morita, Y. (1999). Stable marriage with incomplete lists and ties. Proceedings of ICALP 7899: the 26th International Colloquium on Automata, Languages and Programming, 1644:443- 452.
  6. Manlove, D. (1999). Stable marriage with ties and unacceptable partners. Technical Report TR-1999-29, Computing Science Department of Glasgow University.
  7. McVitie, D. G. and Wilson, L. B. (1971). Three procedures for the stable marriage problem. Communications of the ACM, 14,7:491-492.
  8. Monasse, P. and Guichard, F. (1998). Fast computation of a contrast-invariant image representation. IEEE Trans. on Image Proc., 9(5):860-872.
  9. T. Kavitha, K. Mehlhorn, D. M. and Paluch, K. (2004). Strongly stable matching in time o(nm) and extension to the hospitals-residents problem. STACS'04, pages 222-233.
Download


Paper Citation


in Harvard Style

Y. Zavidovique B., Suvonvorn N. and S. Seetharaman G. (2005). A NOVEL REPRESENTATION AND ALGORITHMS FOR (QUASI) STABLE MARRIAGES . In Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 972-8865-29-5, pages 63-70. DOI: 10.5220/0001159900630070


in Bibtex Style

@conference{icinco05,
author={B. Y. Zavidovique and N. Suvonvorn and Guna S. Seetharaman},
title={A NOVEL REPRESENTATION AND ALGORITHMS FOR (QUASI) STABLE MARRIAGES},
booktitle={Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2005},
pages={63-70},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001159900630070},
isbn={972-8865-29-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A NOVEL REPRESENTATION AND ALGORITHMS FOR (QUASI) STABLE MARRIAGES
SN - 972-8865-29-5
AU - Y. Zavidovique B.
AU - Suvonvorn N.
AU - S. Seetharaman G.
PY - 2005
SP - 63
EP - 70
DO - 10.5220/0001159900630070