The complexity of manipulative attacks in nearly single-peaked electorates (Q490458): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
Normal rank
 
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2013.11.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991113796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matching with preferences derived from a psychological model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational difficulty of manipulating an election / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliciting Single-Peaked Preferences Using Comparison Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of bounded nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Unidimensional Unfolding Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized juntas and NP-hard sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Richer Understanding of the Complexity of Election Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimode Control Attacks on Elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shield that never was: societies with single-peaked preferences are more open to manipulation and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anyone but him: the complexity of precluding an alternative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reductions of NP sets to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and closeness to complexity classes / rank
 
Normal rank

Latest revision as of 17:23, 10 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references