On a new algorithm for stable assignment

J. B. Rosen, S. Z. Sun, G. L. Xue

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

The concept of stable assignment comes from a classical assignment problem called the Stable Marriage Assignment. Suppose that there are two disjoint sets, one consists of men and the other of women. Each member of a set ranks the members of the other set in order of preference. Matching persons between two sets is a one-to-one relation. If there does not exist a random pair both preferring each other to their assigned partner, the assignment is said to be stable. In a recent paper. Huang and Chan generalized the above one-to-one type assignment problem to a multi-function assignment problem and proposed an algorithm for finding stable assignments for both problems. In this paper, we present a couterexample for which the assignment obtained by that algorithm is not stable.

Original languageEnglish (US)
Pages (from-to)165-167
Number of pages3
JournalInternational Journal of Computer Mathematics
Volume41
Issue number3-4
DOIs
StatePublished - Jan 1 1992
Externally publishedYes

Keywords

  • Stable assignment problem
  • counterexample

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On a new algorithm for stable assignment'. Together they form a unique fingerprint.

  • Cite this