Stable matching with uncertain linear preferences (Q2309477)

From MaRDI portal
Revision as of 04:55, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Stable matching with uncertain linear preferences
scientific article

    Statements

    title
    Stable matching with uncertain linear preferences (English)
    0 references
    author
    Haris Aziz
    0 references
    Péter Biró
    0 references
    Serge Gaspers
    0 references
    Ronald de Haan
    0 references
    Nicholas Mattei
    0 references
    Baharak Rastegari
    0 references
    published in
    Algorithmica
    0 references
    publication date
    1 April 2020
    0 references
    Mathematics Subject Classification ID
    91B68
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    7184209
    0 references
    zbMATH Keywords
    stable matchings
    0 references
    stable marriage problem
    0 references
    uncertain preferences
    0 references
    NP-hard problems
    0 references
    polynomial-time algorithms
    0 references
    Wikidata QID
    Q90667602
    0 references
    OpenAlex ID
    W2984092209
    0 references
    arXiv ID
    1607.02917
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2309477&oldid=33496037"
    Powered by MediaWiki