scientific article; zbMATH DE number 6928629
From MaRDI portal
Publication:4583963
zbMATH Open1394.91121MaRDI QIDQ4583963FDOQ4583963
Jörg Rothe, Lena Schend, Yannick Reisch
Publication date: 29 August 2018
Full work available at URL: http://ebooks.iospress.nl/volumearticle/37214
Title of this publication is not available (Why is that?)
computational complexitycomputational social choicemargin of victoryCopeland electionscup electionsSchulze elections
Cited In (7)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Election Manipulation 100
- Complexity of shift bribery for iterative voting rules
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
- Toward Computing the Margin of Victory in Single Transferable Vote Elections
- Predicting winner and estimating margin of victory in elections using sampling
- A note on the complexity of manipulating weighted Schulze voting
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 👍 👎
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)
