Computing a small agreeable set of indivisible items (Q2321268)

From MaRDI portal
Revision as of 18:18, 15 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128735368, #quickstatements; #temporary_batch_1726420686562)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing a small agreeable set of indivisible items
scientific article

    Statements

    title
    Computing a small agreeable set of indivisible items (English)
    0 references
    author
    Pasin Manurangsi
    0 references
    Warut Suksompong
    0 references
    publication date
    28 August 2019
    0 references
    zbMATH Keywords
    agreeability
    0 references
    indivisible items
    0 references
    resource allocation
    0 references
    social choice
    0 references
    cites work
    Combinatorial Voting
    0 references
    Splitting necklaces
    0 references
    Q3503433
    0 references
    Q5365074
    0 references
    Q3624140
    0 references
    Q4198056
    0 references
    Q5765710
    0 references
    Q2941638
    0 references
    Q4527015
    0 references

    Identifiers

    zbMATH DE Number
    7099179
    0 references
    OpenAlex ID
    W2471455272
    0 references
    Wikidata QID
    Q128735368
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2321268&oldid=37844448"
    Powered by MediaWiki