Pages that link to "Item:Q1743720"
From MaRDI portal
The following pages link to Complexity of manipulation with partial information in voting (Q1743720):
Displaying 17 items.
- Algorithms for the coalitional manipulation problem (Q835815) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Manipulation of voting schemes with restricted beliefs (Q952695) (← links)
- Nonmanipulable voting schemes when participants' interests are partially decomposable (Q1178175) (← links)
- Manipulative elicitation -- a new attack on elections with incomplete preferences (Q1637215) (← links)
- The computational difficulty of manipulating an election (Q1824524) (← links)
- Threshold strategy-proofness: on manipulability in large voting problems (Q1886747) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Distance restricted manipulation in voting (Q2235758) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- Simultaneous elicitation of scoring rule and agent preferences for robust winner determination (Q2695426) (← links)
- Search versus Decision for Election Manipulation Problems (Q5053055) (← links)
- Incomplete Information and Communication in Voting (Q5133013) (← links)
- Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty (Q5278045) (← links)
- False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time (Q5405028) (← links)
- Hardness and algorithms for electoral manipulation under media influence (Q6113911) (← links)
