An algorithm to compute the full set of many-to-many stable matchings. (Q1431789): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q918446
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jorge A. Oviedo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.mathsocsci.2003.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126603812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preferences over subsets and the lattice structure of stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lattice Structure of the Set of Stable Matchings with Multiple Partners / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Matching, Coalition Formation, and Gross Substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lattice structure of the set of stable matchings for a many-to-one model<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Polarization of Interests in Job Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three remarks on the many-to-many stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice structure of the set of stable outcomes of the multiple partners assignment game / rank
 
Normal rank

Latest revision as of 16:49, 6 June 2024

scientific article
Language Label Description Also known as
English
An algorithm to compute the full set of many-to-many stable matchings.
scientific article

    Statements

    An algorithm to compute the full set of many-to-many stable matchings. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2004
    0 references
    Matching
    0 references
    Stability
    0 references
    Substitutable preferences
    0 references
    Algorithm
    0 references

    Identifiers