On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
From MaRDI portal
Publication:3586077
DOI10.1007/978-3-642-15155-2_12zbMath1287.91045OpenAlexW1589515210MaRDI QIDQ3586077
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_12
Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (8)
Studies in Computational Aspects of Voting ⋮ The complexity of online manipulation of sequential elections ⋮ The possible winner with uncertain weights problem ⋮ Kernelization complexity of possible winner and coalitional manipulation problems in voting ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Towards a dichotomy for the possible winner problem in elections based on scoring rules ⋮ Multivariate complexity analysis of Swap Bribery ⋮ Multivariate Complexity Analysis of Swap Bribery
This page was built for publication: On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
