Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717)

From MaRDI portal
Revision as of 17:01, 9 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
Control complexity in Bucklin and fallback voting: a theoretical analysis
scientific article

    Statements

    title
    Control complexity in Bucklin and fallback voting: a theoretical analysis (English)
    0 references
    author
    Gábor Erdélyi
    0 references
    Michael R. Fellows
    0 references
    Jörg Rothe
    0 references
    Lena Schend
    0 references
    publication date
    20 February 2015
    0 references
    zbMATH Keywords
    computational social choice
    0 references
    control complexity
    0 references
    Bucklin voting
    0 references
    fallback voting
    0 references
    parameterized complexity
    0 references
    election systems
    0 references
    cites work
    Q3626678
    0 references
    Q4393480
    0 references
    Q4198056
    0 references
    Q3457243
    0 references
    Q3624161
    0 references
    Q5710169
    0 references
    Q4298260
    0 references
    Q3624050
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91B14
    0 references
    91B12
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6406623
    0 references
    OpenAlex ID
    W2065610364
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2256717&oldid=35439637"
    Powered by MediaWiki