抄録
The stable marriage model due to Gale and Shapley is one of the most fundamental two-sided matching models. Recently, Kleiner generalized the model in terms of matroids, and Eguchi and Fujishige extended the matroidal model to the framework of discrete convex analysis. In this paper, we extend their model to a vector version in which indifference on preferences is allowed, and show the existence of a stable solution by a generalization of the Gale-Shapley algorithm.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 495-504 |
| ページ数 | 10 |
| ジャーナル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 巻 | 2906 |
| 出版ステータス | Published - 2003 12 1 |
| 外部発表 | はい |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)