The complexity of manipulative attacks in nearly single-peaked electorates (Q490458)

From MaRDI portal
Revision as of 19:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of manipulative attacks in nearly single-peaked electorates
scientific article

    Statements

    The complexity of manipulative attacks in nearly single-peaked electorates (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms and complexity
    0 references
    computational social choice
    0 references
    election control
    0 references
    election manipulation
    0 references
    multiagent systems
    0 references
    nearly single-peaked preferences
    0 references
    0 references