Pages that link to "Item:Q2463791"

The following pages link to On complexity of lobbying in multiple referenda (Q2463791):

Displaying 20 items.

• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← links)
• Parameterized complexity of control problems in Maximin election (Q656582) (← links)
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
• Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
• Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
• Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
• Approximation and hardness of shift-Bribery (Q2238694) (← links)
• Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
• Bribery in voting with CP-nets (Q2436697) (← links)
• On complexity of lobbying in multiple referenda (Q2463791) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
• Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
• Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)
• Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)
• Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas (Q6178460) (← links)