Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s10472-013-9359-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023411822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the single-peaked domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / 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: Voting schemes for which it can be difficult to tell who won the 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: Computational Aspects of Approval Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problem Kernels for Possible Winner Determination under the k-Approval Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in Computational Aspects of Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Computational Complexity of Dodgson and Young Elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates / 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: Parameterized computational complexity of control problems in voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / 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: The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules / 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: Multivariate Complexity Analysis of Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Actual Application of Collective Choice Theory to the Selection of Trajectories for the Mariner Jupiter/Saturn 1977 Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control complexity in Bucklin and fallback voting: a theoretical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency of correctness versus average polynomial time / 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: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of manipulative attacks in nearly single-peaked electorates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimode Control Attacks on Elections / 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: A Richer Understanding of the Complexity of Election Systems / 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: A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of social homogeneity on coincidence probabilities for pairwise proportional lottery and simple majority rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Levin’s Theory of Average-Case Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search versus Decision for Election Manipulation Problems / 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: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymptotic strategy-proofness of the plurality and the run-off rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant scoring rules, Condorcet criteria and single-peaked preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and closeness to complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of control problems in Maximin election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Dodgson's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized range voting broadly resists control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative gibbard-satterthwaite theorem without neutrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How large should a coalition be to manipulate an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control complexity in Bucklin and fallback voting: an experimental analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymptotic strategy-proofness of classical social choice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence of clones as a criterion for voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the coalitional manipulation problem / rank
 
Normal rank

Latest revision as of 09:17, 7 July 2024

scientific article
Language Label Description Also known as
English
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
scientific article

    Statements

    Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (English)
    0 references
    0 references
    0 references
    25 February 2014
    0 references
    computational social choice
    0 references
    voting theory
    0 references
    manipulation
    0 references
    control
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers