## 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 language | English (US) |
---|---|

Pages (from-to) | 165-167 |

Number of pages | 3 |

Journal | International Journal of Computer Mathematics |

Volume | 41 |

Issue number | 3-4 |

DOIs | |

State | Published - Jan 1 1992 |

Externally published | Yes |

## Keywords

- Stable assignment problem
- counterexample

## ASJC Scopus subject areas

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