The following pages link to Extending Condorcet's rule (Q1254926):
Displayed 17 items.
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Independence of clones as a criterion for voting rules (Q579096) (← links)
- Distance rationalization of voting rules (Q892848) (← links)
- A theory of coalition formation in committees (Q1140018) (← links)
- The effectiveness of weighted scoring rules when pairwise majority rule cycles exist. (Q1420529) (← links)
- Welfare maximization entices participation (Q1735819) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- Condorcet consistency and the strong no show paradoxes (Q2334862) (← links)
- On stable rules for selecting committees (Q2358564) (← links)
- A partial taxonomy of judgment aggregation rules and their properties (Q2397659) (← links)
- Rationalizations of Condorcet-consistent rules via distances of Hamming type (Q2450151) (← links)
- Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)