MAJORITY VOTING IN STABLE MARRIAGE PROBLEM WITH COUPLES - Using a monotone systems based tournament approach

Tarmo Veskioja, Leo Võhandu

Abstract

Providing centralised matching services can be viewed as a group decision support system (GDSS) for the participants to reach a stable matching solution. In the original stable marriage problem all the participants have to rank all members of the opposite party. Two variations for this problem allow for incomplete preference lists and ties in preferences. If members from one side are allowed to form couples and submit combined preferences, then the set of stable matchings may be empty (Roth et al., 1990). In that case it is necessary to use majority voting between matchings in a tournament. We propose a majority voting tournament method based on monotone systems and a value function for it. The proposed algorithm should minimize transitivity faults in tournament ranking.

References

  1. Gale, D., Shapley, L., 1962. College Admissions and the Stability of Marriage. In American Mathematical Monthly, 69(1), pp.9-15.
  2. Gusfield, D., Irwing, R. W., 1989. Stable Marriage Problem: Structure and Algorithms, MIT Press Series in the Foundations of Computing, MIT Press, Cambridge, Massachusetts.
  3. Gärdenfors, P., 1975. Match Making: Assignments Based on Bilateral Preferences, In Behavioral Science, 20, pp.166-173.
  4. Halldórsson, M., Iwama, K., Miyazaki, S., Morita, Y., 2002. Inapproximability results on stable marriage problems, In Proceedings of LATIN 2002: the LatinAmerican Theoretical INformatics symposium, volume 2286 of Lecture Notes in Computer Science, pp. 554- 568. Springer-Verlag.
  5. Iwama, K., Manlove, D., Miyazaki, S., Morita, Y., 1999. Stable marriage with incomplete lists and ties, In Proc. ICALP'99, pp.443-452.
  6. Klijn,F., Masso,J., 2003. Weak stability and a bargaining set for the marriage model, in Games and Economic Behavior, 42, pp. 91-100.
  7. Mullat, I., 1976. Extremal Subsystem of Monotone Systems. In Automation and Remote Control, 5, pp. 130-139; 8, pp. 169-178 (in Russian)
  8. Ronn, E., 1986. On the complexity of stable matchings with and without ties, Ph.D. diss., Yale University.
  9. Ronn, E., 1987. NP-complete stable matching problems, Computer Science Department, Technion - Israel Institute of Technology. Mimeo
  10. Roth, A., Sotomayor, M., 1990. Two-sided matching : a study in game-theoretic modeling and analysis, Cambridge University Press, Econometric Society Monographs, no.18, Cambridge, Massachusetts, USA.
  11. Võhandu, L., 1989. Fast Methods in Exploratory Data Analysis, In Proceedings of Tallinn Technical University, Tallinn, No. 705, pp. 3-13.
  12. Võhandu, L., 1990. Best Orderings in Tournaments, In Proceedings of Tallinn Technical University, Tallinn, No. 723, pp. 8-14.
Download


Paper Citation


in Harvard Style

Veskioja T. and Võhandu L. (2004). MAJORITY VOTING IN STABLE MARRIAGE PROBLEM WITH COUPLES - Using a monotone systems based tournament approach . In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 972-8865-00-7, pages 442-447. DOI: 10.5220/0002655904420447


in Bibtex Style

@conference{iceis04,
author={Tarmo Veskioja and Leo Võhandu},
title={MAJORITY VOTING IN STABLE MARRIAGE PROBLEM WITH COUPLES - Using a monotone systems based tournament approach},
booktitle={Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2004},
pages={442-447},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002655904420447},
isbn={972-8865-00-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - MAJORITY VOTING IN STABLE MARRIAGE PROBLEM WITH COUPLES - Using a monotone systems based tournament approach
SN - 972-8865-00-7
AU - Veskioja T.
AU - Võhandu L.
PY - 2004
SP - 442
EP - 447
DO - 10.5220/0002655904420447