Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A class of multipartner matching markets with a strong lattice structure / 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: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute the full set of many-to-many stable matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Closure of a Graph and Applications to Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Applications of Minimum Cuts in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / 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: Q3999327 / 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
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 11:13, 26 June 2024

scientific article
Language Label Description Also known as
English
Polynomial time algorithm for an optimal stable assignment with multiple partners
scientific article

    Statements

    Polynomial time algorithm for an optimal stable assignment with multiple partners (English)
    0 references
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    stable marriage
    0 references
    multiple partners
    0 references
    optimal assignment
    0 references
    substitutes
    0 references
    dis-satisfaction score
    0 references
    meta-rotation
    0 references

    Identifiers