Pages that link to "Item:Q2829683"
From MaRDI portal
The following pages link to Computational Aspects of Approval Voting (Q2829683):
Displaying 20 items.
- A statistical approach to calibrating the scores of biased reviewers of scientific papers (Q267651) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
