Stable matching games: manipulation via subgraph isomorphism (Q722540)

From MaRDI portal
Revision as of 02:02, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Stable matching games: manipulation via subgraph isomorphism
scientific article

    Statements

    title
    Stable matching games: manipulation via subgraph isomorphism (English)
    0 references
    author
    Sushmita Gupta
    0 references
    Sanjukta Roy
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 July 2018
    0 references
    zbMATH Keywords
    stable matching
    0 references
    Gale-Shapley algorithm
    0 references
    suitor graph
    0 references
    subgraph isomorphism
    0 references
    exact-exponential time algorithms
    0 references
    manipulation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C60
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q17
    0 references
    91B68
    0 references
    zbMATH DE Number
    6911199
    0 references
    OpenAlex ID
    W2766788849
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q722540&oldid=38461563"
    Powered by MediaWiki