Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 495-504 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2906 |
| Publication status | Published - 2003 Dec 1 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)