Extending Condorcet's rule
From MaRDI portal
Publication:1254926
DOI10.1016/0022-0531(77)90012-6zbMath0399.90006OpenAlexW2100560478MaRDI QIDQ1254926
Publication date: 1977
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0531(77)90012-6
Related Items
On stable rules for selecting committees ⋮ The complexity of online bribery in sequential elections ⋮ Are there any nicely structured preference profiles nearby? ⋮ Studies in Computational Aspects of Voting ⋮ Control of Condorcet voting: complexity and a relation-algebraic approach ⋮ A partial taxonomy of judgment aggregation rules and their properties ⋮ The complexity of computing minimal unidirectional covering sets ⋮ Distance rationalization of voting rules ⋮ A theory of coalition formation in committees ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Parameterized Computational Complexity of Dodgson and Young Elections ⋮ The effectiveness of weighted scoring rules when pairwise majority rule cycles exist. ⋮ Rationalizations of Condorcet-consistent rules via distances of Hamming type ⋮ The Complexity Landscape of Outcome Determination in Judgment Aggregation ⋮ Welfare maximization entices participation ⋮ Voting Procedures, Complexity of ⋮ Minimal envy and popular matchings ⋮ On the approximability of Dodgson and Young elections ⋮ Parameterized computational complexity of Dodgson and Young elections ⋮ Independence of clones as a criterion for voting rules ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control ⋮ Condorcet consistency and the strong no show paradoxes
Cites Work
