On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm / 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: Parameterized complexity of candidate control in elections and related digraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in Computational Aspects of Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Election Campaigns: Combinatorial Shift Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial voter control in elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elections with Few Voters: Candidate Control Can Be Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / 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: 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: Weighted Electoral Control / 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: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Variants of Combinatorial Voter Control in Elections / 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: Parameterized computational complexity of control problems in voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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

Latest revision as of 20:09, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
scientific article

    Statements

    On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    0 references
    0 references

    Identifiers