Pages that link to "Item:Q3651465"

The following pages link to Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (Q3651465):

Displaying 50 items.

• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
• The complexity of priced control in elections (Q314424) (← links)
• On the hardness of bribery variants in voting with CP-nets (Q314427) (← 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)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• Normalized range voting broadly resists control (Q385502) (← links)
• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← 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)
• Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
• Frugal bribery in voting (Q527399) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← 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 gerrymandering over graphs (Q831130) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• On the complexity of kings (Q846367) (← 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)
• Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
• Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
• How hard is it to control an election? (Q1200886) (← links)
• Extending tournament solutions (Q1616754) (← links)
• Inconsistency of special cases of pairwise comparisons matrices (Q1642754) (← links)
• Optimal defense against election control by deleting voter groups (Q1647508) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• On the complexity of bribery with distance restrictions (Q1713407) (← links)
• When is the condition of order preservation met? (Q1735187) (← 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)
• A parameterized perspective on protecting elections (Q2034407) (← links)
• Margin of victory for tournament solutions (Q2060724) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• Structural control in weighted voting games (Q2098945) (← links)
• The complexity of online bribery in sequential elections (Q2121471) (← links)
• Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
• Local distance constrained bribery in voting (Q2215965) (← 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)
• Robustness of approval-based multiwinner voting rules (Q2290364) (← links)