Pages that link to "Item:Q3511426"
From MaRDI portal
The following pages link to Copeland Voting Fully Resists Constructive Control (Q3511426):
Displaying 12 items.
- Parameterized complexity of control problems in Maximin election (Q656582) (← 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)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← 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)
- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control (Q3599137) (← links)
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)