Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Stabilizing Unstable Matching because of a Varied Preference List in Distributed Stable Marriage Problem

  • Kinjo, Hideki (Department of Information Engineering, University of The Ryukyus) ;
  • Nakamura, Morikazu (Department of Information Engineering, University of The Ryukyus) ;
  • Onaga, Kenji (Okinawa Research Center, Telecommunication Advancement Organization)
  • Published : 2000.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

A distributed stable marriage problem in extended in this paper. The traditional approach related to the stable matching problem assume that preference lists are fixed. However, in decentralized version this assumption is not reasonable because of the autonomy of members. In this paper, we consider the situation that a preference list can be varied at some stable matching and show the condition to be broken the stability of the original matching. Moreover, we propose a stabilization algorithm to obtain a stable matching by execution with a minimal set of members.

Keywords