Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How hard is it to control an election? / 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: Voting schemes for which it can be difficult to tell who won the election / 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: Single transferable vote resists strategic voting / 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: Q5671815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Condorcet's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Consistent Extension of Condorcet’s Election Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of the winner problem for Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean operations, joins, and the extended low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sets, Lowness and Highness / 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: Q2783476 / 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: 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: Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copeland Voting Fully Resists Constructive Control / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control / 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: Q3624161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472458 / 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: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Dodgson's rule / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266133 / rank
 
Normal rank

Latest revision as of 21:48, 1 July 2024

scientific article
Language Label Description Also known as
English
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
scientific article

    Statements

    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2009
    0 references
    computational social choice
    0 references
    multi-agent systems
    0 references
    preference aggregation
    0 references
    computational complexity
    0 references
    manipulability
    0 references
    voting system
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references