Pareto optimality in many-to-many matching problems (Q2339842): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tale of two mechanisms: Student placement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: House allocation with existing tenants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank

Latest revision as of 22:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Pareto optimality in many-to-many matching problems
scientific article

    Statements

    Pareto optimality in many-to-many matching problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 April 2015
    0 references
    matching
    0 references
    Pareto optimality
    0 references
    serial dictatorship
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references