On a new algorithm for stable assignment

J. B. Rosen, S. Z. Sun, Guoliang Xue

Research output: Contribution to journalArticle

1 Citation (Scopus)

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

Fingerprint

Assignment
Assignment Problem
Stable Marriage
Person
Disjoint

Keywords

  • counterexample
  • Stable assignment problem

ASJC Scopus subject areas

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

Cite this

On a new algorithm for stable assignment. / Rosen, J. B.; Sun, S. Z.; Xue, Guoliang.

In: International Journal of Computer Mathematics, Vol. 41, No. 3-4, 01.01.1992, p. 165-167.

Research output: Contribution to journalArticle

Rosen, J. B. ; Sun, S. Z. ; Xue, Guoliang. / On a new algorithm for stable assignment. In: International Journal of Computer Mathematics. 1992 ; Vol. 41, No. 3-4. pp. 165-167.
@article{397bf9ba674b417f851e50c58b2378f5,
title = "On a new algorithm for stable assignment",
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.",
keywords = "counterexample, Stable assignment problem",
author = "Rosen, {J. B.} and Sun, {S. Z.} and Guoliang Xue",
year = "1992",
month = "1",
day = "1",
doi = "10.1080/00207169208804036",
language = "English (US)",
volume = "41",
pages = "165--167",
journal = "International Journal of Computer Mathematics",
issn = "0020-7160",
publisher = "Taylor and Francis Ltd.",
number = "3-4",

}

TY - JOUR

T1 - On a new algorithm for stable assignment

AU - Rosen, J. B.

AU - Sun, S. Z.

AU - Xue, Guoliang

PY - 1992/1/1

Y1 - 1992/1/1

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

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

KW - counterexample

KW - Stable assignment problem

UR - http://www.scopus.com/inward/record.url?scp=84885676856&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885676856&partnerID=8YFLogxK

U2 - 10.1080/00207169208804036

DO - 10.1080/00207169208804036

M3 - Article

AN - SCOPUS:84885676856

VL - 41

SP - 165

EP - 167

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 3-4

ER -