Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2014.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065610364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Majority Voting (or How to Eliminate Gerrymandering) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / 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: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Approval Voting / 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: Studies in Computational Aspects of Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626678 / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic technique for multi-agent planning / 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: Control complexity in Bucklin and fallback voting: an experimental analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control and Bribery in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / 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: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimode Control Attacks on Elections / 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: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search versus Decision for Election Manipulation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of online manipulation of sequential elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of control problems in Maximin election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of control problems in voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized range voting broadly resists control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative gibbard-satterthwaite theorem without neutrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity theory and cryptology. An introduction to cryptocomplexity. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:01, 9 July 2024

scientific article
Language Label Description Also known as
English
Control complexity in Bucklin and fallback voting: a theoretical analysis
scientific article

    Statements

    Control complexity in Bucklin and fallback voting: a theoretical analysis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2015
    0 references
    computational social choice
    0 references
    control complexity
    0 references
    Bucklin voting
    0 references
    fallback voting
    0 references
    parameterized complexity
    0 references
    election systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers