The possible winner with uncertain weights problem

DOI10.1016/J.JCSS.2023.103464MaRDI QIDQ6133655zbMATH OpenFDO

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

Publication date 21 August 2023

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

Full work available at URL https://doi.org/10.1016/J.JCSS.2023.103464

zbMATH Keywords

computational complexityuncertaintycomputational social choicevoting rulepossible winner

Mathematics Subject Classification ID

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

Recommendations

• The possible winner problem with uncertain weights
• The possible winner problem with uncertain weights revisited
• On the evaluation of election outcomes under uncertainty
• Determining possible and necessary winners given partial orders
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Acceptance in incomplete argumentation frameworks
• Anyone but him: the complexity of precluding an alternative
• Cloning in elections: finding the possible winners
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• 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
• Determining possible and necessary winners given partial orders
• Duplication monotonicity in the allocation of indivisible goods
• Geometric algorithms and combinatorial optimization
• Handbook of Computational Social Choice
• Hedonic games with ordinal preferences and thresholds
• How hard is it to control an election?
• Integer Programming with a Fixed Number of Variables
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• Mathematical Derivation of an Election System
• Multimode control attacks on elections
• Multivariate complexity analysis of Swap Bribery
• New candidates welcome! Possible winners with respect to the addition of new candidates
• On problem kernels for possible winner determination under the k-approval protocol
• Swap bribery
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
• The complexity of Kemeny elections
• The possible winner problem with uncertain weights
• The possible winner problem with uncertain weights revisited
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• Verification in incomplete argumentation frameworks
• When are elections with few candidates hard to manipulate?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133655)