Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720)

From MaRDI portal
Revision as of 11:13, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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