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

Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura

研究成果: Article査読

11 被引用数 (Scopus)

抄録

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)

フィンガープリント 「A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル