Parliamentary voting procedures: agenda control, manipulation, and uncertainty
From MaRDI portal
(Redirected from Publication:5278045)
Abstract: We study computational problems for two popular parliamentary voting procedures: the amendment procedure and the successive procedure. While finding successful manipulations or agenda controls is tractable for both procedures, our real-world experimental results indicate that most elections cannot be manipulated by a few voters and agenda control is typically impossible. If the voter preferences are incomplete, then finding which alternatives can possibly win is NP-hard for both procedures. Whilst deciding if an alternative necessarily wins is coNP-hard for the amendment procedure, it is polynomial-time solvable for the successive one.
Recommendations
Cited in
(8)- Manipulative agendas in four-candidate elections
- Controlling the order of moves in voting by veto. II. Algorithms for constructing an optimal order of moves
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
- Black and Farquharson on order-of-voting effects: An extension
- Sequential voting and agenda manipulation
- Agenda-Manipulation in Ranking
- On the parameterized complexity of controlling amendment and successive winners
- The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
This page was built for publication: Parliamentary voting procedures: agenda control, manipulation, and uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278045)