• Title of article

    On the complexity of exchange-stable roommates

  • Author/Authors

    Katarina Cechlarova، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2001
  • Pages
    9
  • From page
    279
  • To page
    287
  • Abstract
    For the stable roommates problem recently a new concept, exchange stability, was introduced. In this paper we prove that it is NP-complete to decide whether for a given preference profile an exchange stable matching exists.
  • Keywords
    Exchange stability , NP-completeness , Stable roommates problem
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    2001
  • Journal title
    Discrete Applied Mathematics
  • Record number

    885343

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=885343