A probabilistic version of the stable marriage problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1983 English Publisher:Springer Science and Business Media LLCJournal:BIT, volume 23, pages 161-169 (issn: 0006-3835, eissn: 1572-9125,

Copyright policy )

Authors: Stephen Y. Itoga;

doi: 10.1007/bf02218437

A probabilistic version of the stable marriage problem

- Summary
- Subjects
- Metrics

Abstract

A new interpretation of the stable marriage problem posed by Gale and Shapley is presented. This approach enables one to solve efficiently this version of the assignment problem when it is known that the preference information is inaccurate or when there is a need to reduce the computational requirements of the problem. Savings on the order of 30% for CPU time have been demonstrated in test cases.

Related Organizations

University of Hawaiʻi Sea Grant
United States
University of Hawaii System
United States

Keywords

Deterministic scheduling theory in operations research, combinatorics, probabilistic stable marriage problem, tau-stability, preference information, assignment problem, 23, 161-169 (1983), computational experience

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average