A one-sided many-to-many matching problem (Q2402821)

From MaRDI portal
Revision as of 09:19, 14 July 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
A one-sided many-to-many matching problem
scientific article

    Statements

    title
    A one-sided many-to-many matching problem (English)
    0 references
    author
    Yasunori Okumura
    0 references
    publication date
    14 September 2017
    0 references
    zbMATH Keywords
    matching
    0 references
    market design
    0 references
    maximum \(c\)-matching
    0 references
    network formation
    0 references
    strategy-proof
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91B68
    0 references
    91A12
    0 references
    91A43
    0 references
    zbMATH DE Number
    6774899
    0 references
    OpenAlex ID
    W2744393899
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2402821&oldid=36344626"
    Powered by MediaWiki