A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model

Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 languageEnglish
Pages (from-to)495-504
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2906
Publication statusPublished - 2003
Externally publishedYes

Fingerprint

Stable Marriage
Marriage
Model Matching
Convex Analysis
Stable Solution
Matroid
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{032bcc8ac03442f2a6a3e0b711343113,
title = "A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model",
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.",
author = "Akinobu Eguchi and Satoru Fujishige and Akihisa Tamura",
year = "2003",
language = "English",
volume = "2906",
pages = "495--504",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model

AU - Eguchi, Akinobu

AU - Fujishige, Satoru

AU - Tamura, Akihisa

PY - 2003

Y1 - 2003

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

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

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

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

M3 - Article

AN - SCOPUS:21144437975

VL - 2906

SP - 495

EP - 504

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -