Pages that link to "Item:Q3546334"

The following pages link to When are elections with few candidates hard to manipulate? (Q3546334):

Displaying 50 items.

• Ranking chain sum orders (Q290525) (← links)
• Manipulation complexity of same-system runoff elections (Q314418) (← links)
• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
• Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
• Solving hard control problems in voting systems via integer programming (Q322433) (← links)
• Computational complexity of manipulation: a survey (Q334204) (← links)
• Is it ever safe to vote strategically? (Q404772) (← links)
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
• New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
• Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
• The complexity of controlling candidate-sequential elections (Q526900) (← links)
• Frugal bribery in voting (Q527399) (← links)
• Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
• Parameterized complexity of control problems in Maximin election (Q656582) (← links)
• Is computational complexity a barrier to manipulation? (Q656822) (← 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)
• Algorithms for the coalitional manipulation problem (Q835815) (← links)
• The learnability of voting rules (Q840821) (← links)
• Dichotomy for voting systems (Q859982) (← links)
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
• On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
• Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
• Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
• Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
• Complexity of manipulation with partial information in voting (Q1743720) (← links)
• Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
• On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
• Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• The complexity of online bribery in sequential elections (Q2121471) (← links)
• The possible winner problem with uncertain weights revisited (Q2140520) (← 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)
• Weighted partial order oriented three-way decisions under score-based common voting rules (Q2191250) (← links)
• A note on the complexity of manipulating weighted Schulze voting (Q2203580) (← links)
• Local distance constrained bribery in voting (Q2215965) (← links)
• Distance restricted manipulation in voting (Q2235758) (← 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)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
• Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)