Pages that link to "Item:Q5192366"
From MaRDI portal
The following pages link to A Richer Understanding of the Complexity of Election Systems (Q5192366):
Displaying 35 items.
- A statistical approach to calibrating the scores of biased reviewers of scientific papers (Q267651) (← links)
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
- Manipulating the quota in weighted voting games (Q420828) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Analysis and design of electoral systems (Q1779201) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← 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)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Lifting integrity constraints in binary aggregation (Q2446586) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- Election in the Qualitative World (Q3613646) (← links)
- Evaluation and Optimization of Electoral Systems (Q4220552) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (Q5494853) (← links)