Search results
From MaRDI portal
- Control complexity in Bucklin and fallback voting: a theoretical analysis 2015-02-20 Paper Control complexity in Bucklin and fallback voting: an experimental...10 bytes (16 words) - 10:56, 7 October 2023
- Control complexity in Bucklin and fallback voting: a theoretical analysis 2015-02-20 Paper Control complexity in Bucklin and fallback voting: an experimental...10 bytes (16 words) - 09:45, 24 September 2023
- Control complexity in Bucklin and fallback voting: a theoretical analysis 2015-02-20 Paper Control complexity in Bucklin and fallback voting: an experimental...10 bytes (17 words) - 01:24, 10 December 2023
- Control complexity in Bucklin and fallback voting: a theoretical analysis 2015-02-20 Paper Control complexity in Bucklin and fallback voting: an experimental...10 bytes (19 words) - 14:23, 28 January 2024
- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems 2014-01-10 Paper Decomposition and Approximation...10 bytes (17 words) - 12:29, 28 January 2024
- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems 2014-01-10 Paper Sorting genomes by generalized...10 bytes (16 words) - 13:14, 7 October 2023
- complexity; bribery; approval voting; Bucklin voting; campaign management; fallback voting Mathematics Subject Classification ID 91B12: Voting theory 90C39: Dynamic...15 bytes (65 words) - 07:25, 30 January 2024
- Keywords computational social choice; parameterized complexity; Bucklin voting; fallback voting; control complexity; election systems Mathematics Subject Classification...15 bytes (83 words) - 09:20, 2 February 2024
- Keywords experimental analysis; computational social choice; Bucklin voting; fallback voting; control complexity; election systems Mathematics Subject Classification...15 bytes (89 words) - 09:20, 2 February 2024