The possible winner problem with uncertain weights revisited
From MaRDI portal
Publication:2140520
DOI10.1007/978-3-030-86593-1_28OpenAlexW3201195874MaRDI QIDQ2140520
Marc Neveling, Robin Weishaupt, Jörg Rothe
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_28
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
- Verification in incomplete argumentation frameworks
- 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
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Acceptance in incomplete argumentation frameworks
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Determining Possible and Necessary Winners Given Partial Orders
- When are elections with few candidates hard to manipulate?
- Swap Bribery
- Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions
- 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 problem with uncertain weights revisited
