Acyclic roommates

José Alvaro Rodrigues-Neto*

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    Abstract

    In the context of the stable roommates problem, this paper provides an alternative characterization of acyclic instances with n roommates; one that requires checking n - 1 fewer equations than symmetry of the utility functions (Rodrigues-Neto, 2007). We introduce the concepts of agent-cycles and cycle equations and prove that an instance is acyclic if and only if there exists a representation of preferences such that all cycle equations of agent-cycles of length 3 containing an agent i hold. In this case, there is a unique stable matching.

    Original languageEnglish
    Pages (from-to)304-306
    Number of pages3
    JournalEconomics Letters
    Volume118
    Issue number2
    DOIs
    Publication statusPublished - Feb 2013

    Fingerprint

    Dive into the research topics of 'Acyclic roommates'. Together they form a unique fingerprint.

    Cite this