The possible winner with uncertain weights problem

DOI10.1016/j.jcss.2023.103464MaRDI QIDQ6133655

Lirong Xia, Lena Schend, Jörg Rothe, Robin Weishaupt, Marc Neveling, Magnus Roos, Dorothea Baumeister

Publication date: 21 August 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

uncertaintycomputational complexitycomputational social choicevoting rulepossible winner

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
• New candidates welcome! Possible winners with respect to the addition of new candidates
• Verification in incomplete argumentation frameworks
• The complexity of Kemeny elections
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• Anyone but him: the complexity of precluding an alternative
• How hard is it to control an election?
• Geometric algorithms and combinatorial optimization
• Multivariate complexity analysis of Swap Bribery
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• The possible winner problem with uncertain weights revisited
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Acceptance in incomplete argumentation frameworks
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
• Control complexity in Bucklin and fallback voting: a theoretical analysis
• Control complexity in Bucklin and fallback voting: an experimental analysis
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• Determining Possible and Necessary Winners Given Partial Orders
• Integer Programming with a Fixed Number of Variables
• Multimode Control Attacks on Elections
• When are elections with few candidates hard to manipulate?
• On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
• Swap Bribery
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• Hedonic Games with Ordinal Preferences and Thresholds
• Duplication monotonicity in the allocation of indivisible goods
• Handbook of Computational Social Choice
• Mathematical Derivation of an Election System

This page was built for publication: The possible winner with uncertain weights problem