Parameterized computational complexity of control problems in voting systems (Q1029347): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of social choice and welfare. Vol. 1. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Code is \(W[1]\)-complete / 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: Q4393480 / 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: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copeland Voting Fully Resists Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / 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: Q3624161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank

Latest revision as of 19:12, 1 July 2024

scientific article
Language Label Description Also known as
English
Parameterized computational complexity of control problems in voting systems
scientific article

    Statements

    Parameterized computational complexity of control problems in voting systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2009
    0 references
    voting systems
    0 references
    constructive control
    0 references
    destructive control
    0 references
    plurality voting
    0 references
    Condorcet voting
    0 references
    approval voting
    0 references
    parameterized complexity
    0 references

    Identifiers