Pages that link to "Item:Q1200886"

The following pages link to How hard is it to control an election? (Q1200886):

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)
• 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)
• 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)
• 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)
• 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)
• Generalized juntas and NP-hard sets (Q837194) (← links)
• The learnability of voting rules (Q840821) (← links)
• Vote trading in public elections (Q855754) (← links)
• NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← 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)
• Optimal defense against election control by deleting voter groups (Q1647508) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• A parameterized perspective on protecting elections (Q2034407) (← 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)
• Computer science and decision theory (Q2271874) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
• Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
• Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
• Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)