Is computational complexity a barrier to manipulation? (Q656822): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Incompleteness and incomparability in preference aggregation: complexity results / 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: Q3993509 / 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: 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: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579475 / 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: Multimode Control Attacks on Elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulating Tournaments in Cup and Round Robin Competitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / 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: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / 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: Q3093654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems are sometimes hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A physicist's approach to number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TSP phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: Flaws and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shield that never was: societies with single-peaked preferences are more open to manipulation and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economics of Matching: Stability and Incentives / rank
 
Normal rank

Latest revision as of 20:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Is computational complexity a barrier to manipulation?
scientific article

    Statements

    Is computational complexity a barrier to manipulation? (English)
    0 references
    13 January 2012
    0 references
    social choice
    0 references
    manipulation
    0 references
    computational complexity
    0 references
    stable marriage
    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