The possible winner with uncertain weights problem
From MaRDI portal
Publication:6133655
DOI10.1016/J.JCSS.2023.103464MaRDI QIDQ6133655FDOQ6133655
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)
Social choice (91B14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Integer Programming with a Fixed Number of Variables
- The complexity of Kemeny elections
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Determining possible and necessary winners given partial orders
- When are elections with few candidates hard to manipulate?
- Anyone but him: the complexity of precluding an alternative
- How hard is it to control an election?
- Multivariate complexity analysis of Swap Bribery
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Multimode control attacks on elections
- Title not available (Why is that?)
- Title not available (Why is that?)
- Swap bribery
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- New candidates welcome! Possible winners with respect to the addition of new candidates
- Handbook of Computational Social Choice
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Mathematical Derivation of an Election System
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Acceptance in incomplete argumentation frameworks
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Verification in incomplete argumentation frameworks
- On problem kernels for possible winner determination under the \(k\)-approval protocol
- Hedonic Games with Ordinal Preferences and Thresholds
- The possible winner problem with uncertain weights revisited
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Duplication monotonicity in the allocation of indivisible goods
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
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)