scientific article; zbMATH DE number 6928629

MaRDI QIDQ4583963zbMATH OpenFDO

Authors Yannick Reisch, Jörg Rothe, Lena Schend

Publication date 29 August 2018

Full work available at URL http://ebooks.iospress.nl/volumearticle/37214

zbMATH Keywords

computational complexitycomputational social choiceCopeland electionscup electionsmargin of victorySchulze elections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Recommendations

• Toward Computing the Margin of Victory in Single Transferable Vote Elections
• Kernelization complexity of possible winner and coalitional manipulation problems in voting
• On the computational complexity of variants of combinatorial voter control in elections
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• Exact complexity of the winner problem for Young elections
• Generic difference of expected vote share and probability of victory maximization in simple plurality elections with probabilistic voters
• A note on the complexity of manipulating weighted Schulze voting
• Studies in Computational Aspects of Voting
• Parameterized complexity of voter control in multi-peaked elections
• Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules

Cited in

(7)

• Complexity of shift bribery for iterative voting rules
• A note on the complexity of manipulating weighted Schulze voting
• Predicting winner and estimating margin of victory in elections using sampling
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
• Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
• Toward Computing the Margin of Victory in Single Transferable Vote Elections
• Election Manipulation 100

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583963)