Pages that link to "Item:Q1028907"

The following pages link to Anyone but him: the complexity of precluding an alternative (Q1028907):

Displaying 50 items.

• 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)
• The complexity of priced control in elections (Q314424) (← 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)
• New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
• The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• The complexity of controlling candidate-sequential elections (Q526900) (← 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)
• 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)
• Algorithms for the coalitional manipulation problem (Q835815) (← links)
• The learnability of voting rules (Q840821) (← 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)
• Optimal defense against election control by deleting voter groups (Q1647508) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• Structural control in weighted voting games (Q2098945) (← links)
• Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
• The possible winner problem with uncertain weights revisited (Q2140520) (← links)
• Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
• Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← 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)
• 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)
• Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
• Computational Aspects of Approval Voting (Q2829683) (← links)
• Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← 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)
• Priced gerrymandering (Q6093576) (← links)