Transformation from arbitrary matchings to stable matchings

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

D. E. Knuth (1976, "Mariages stables," Presses Univ. Montréal, Montreal) conjectured that any matching can be transformed to some stable matching by a sequence of b-interchanges. Given a matching M and a blocking pair (m, w) for M, a b-interchange for M by (m, w) is defined as a transformation from M to a matching obtained by replacing two pairs (m, pM (m)) and (pM (w), w) in M with (m, w) and (pM (w), pM (m)). In this paper, we give a counter-example in which some matching cannot be transformed to any stable matching by b-interchanges. However, any matching can be transformed to some stable matching by using b-interchanges and identifying special cycling. We also give an algorithm to find either such cycling or a stable matching.

Original languageEnglish
Pages (from-to)310-323
Number of pages14
JournalJournal of Combinatorial Theory, Series A
Volume62
Issue number2
DOIs
Publication statusPublished - 1993
Externally publishedYes

Fingerprint

Stable Matching
Interchanges
p.m.
Cycling
Arbitrary
Counterexample

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Transformation from arbitrary matchings to stable matchings. / Tamura, Akihisa.

In: Journal of Combinatorial Theory, Series A, Vol. 62, No. 2, 1993, p. 310-323.

Research output: Contribution to journalArticle

@article{4da48e5954cb4940be6eea8a85f708c4,
title = "Transformation from arbitrary matchings to stable matchings",
abstract = "D. E. Knuth (1976, {"}Mariages stables,{"} Presses Univ. Montr{\'e}al, Montreal) conjectured that any matching can be transformed to some stable matching by a sequence of b-interchanges. Given a matching M and a blocking pair (m, w) for M, a b-interchange for M by (m, w) is defined as a transformation from M to a matching obtained by replacing two pairs (m, pM (m)) and (pM (w), w) in M with (m, w) and (pM (w), pM (m)). In this paper, we give a counter-example in which some matching cannot be transformed to any stable matching by b-interchanges. However, any matching can be transformed to some stable matching by using b-interchanges and identifying special cycling. We also give an algorithm to find either such cycling or a stable matching.",
author = "Akihisa Tamura",
year = "1993",
doi = "10.1016/0097-3165(93)90051-9",
language = "English",
volume = "62",
pages = "310--323",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Transformation from arbitrary matchings to stable matchings

AU - Tamura, Akihisa

PY - 1993

Y1 - 1993

N2 - D. E. Knuth (1976, "Mariages stables," Presses Univ. Montréal, Montreal) conjectured that any matching can be transformed to some stable matching by a sequence of b-interchanges. Given a matching M and a blocking pair (m, w) for M, a b-interchange for M by (m, w) is defined as a transformation from M to a matching obtained by replacing two pairs (m, pM (m)) and (pM (w), w) in M with (m, w) and (pM (w), pM (m)). In this paper, we give a counter-example in which some matching cannot be transformed to any stable matching by b-interchanges. However, any matching can be transformed to some stable matching by using b-interchanges and identifying special cycling. We also give an algorithm to find either such cycling or a stable matching.

AB - D. E. Knuth (1976, "Mariages stables," Presses Univ. Montréal, Montreal) conjectured that any matching can be transformed to some stable matching by a sequence of b-interchanges. Given a matching M and a blocking pair (m, w) for M, a b-interchange for M by (m, w) is defined as a transformation from M to a matching obtained by replacing two pairs (m, pM (m)) and (pM (w), w) in M with (m, w) and (pM (w), pM (m)). In this paper, we give a counter-example in which some matching cannot be transformed to any stable matching by b-interchanges. However, any matching can be transformed to some stable matching by using b-interchanges and identifying special cycling. We also give an algorithm to find either such cycling or a stable matching.

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

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

U2 - 10.1016/0097-3165(93)90051-9

DO - 10.1016/0097-3165(93)90051-9

M3 - Article

AN - SCOPUS:38249005148

VL - 62

SP - 310

EP - 323

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -