On the complexity of distributed stable matching with small messages (Q660987)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of distributed stable matching with small messages
scientific article

    Statements

    On the complexity of distributed stable matching with small messages (English)
    0 references
    0 references
    0 references
    6 February 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed complexity
    0 references
    stable matching problem
    0 references
    stable marriage
    0 references
    0 references