5 found
Order:
  1.  2
    The Price of Universality.Edith Hemaspaandra - 1996 - Notre Dame Journal of Formal Logic 37 (2):174-203.
    We investigate the effect on the complexity of adding the universal modality and the reflexive transitive closure modality to modal logics. From the examples in the literature, one might conjecture that adding the reflexive transitive closure modality is at least as hard as adding the universal modality, and that adding either of these modalities to a multi-modal logic where the modalities do not interact can only increase the complexity to EXPTIME-complete. We show that the first conjecture holds under reasonable assumptions (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  2.  41
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  5
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates.Piotr Faliszewski, Edith Hemaspaandra & Lane A. Hemaspaandra - 2014 - Artificial Intelligence 207:69-99.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Anyone but Him: The Complexity of Precluding an Alternative.Edith Hemaspaandra, Lane A. Hemaspaandra & Jörg Rothe - 2007 - Artificial Intelligence 171 (5-6):255-285.