The following pages link to (Q3624161):
Displayed 19 items.
- The complexity of priced control in elections (Q314424) (← links)
- The give-up problem for blocked regional lists with multi-winners (Q554492) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← 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)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Justified representation in approval-based committee voting (Q2397667) (← links)
- Manipulability of consular election rules (Q2417407) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← 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)