Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control.Edith Hemaspaandra, Lane A. Hemaspaandra & Jörg Rothe - 2009 - Mathematical Logic Quarterly 55 (4):397-424.
    Electoral control refers to attempts by an election's organizer to influence the outcome by adding/deleting/partitioning voters or candidates. The important paper of Bartholdi, Tovey, and Trick [1] that introduces control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible.We introduce and study a method of combining two or more candidate-anonymous election schemes in such a way that the combined scheme possesses all the resistances to (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules.Jessica Davies, George Katsirelos, Nina Narodytska, Toby Walsh & Lirong Xia - 2014 - Artificial Intelligence 217 (C):20-42.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control.Marc Neveling & Jörg Rothe - 2021 - Artificial Intelligence 298 (C):103508.
    Download  
     
    Export citation  
     
    Bookmark