A NOVEL REPRESENTATION AND ALGORITHMS FOR (QUASI) STABLE MARRIAGES

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

2005

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.

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