A Consistent Extension of Condorcet’s Election Principle

DOI10.1137/0135023zbMath0385.90010MaRDI QIDQ4166483

H. Peyton Young, A. Levenglick

Publication date: 1978

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://pure.iiasa.ac.at/id/eprint/700/1/RR-77-015.pdf

Mathematics Subject Classification ID

91B14: Social choice

Related Items

Unnamed Item, Median linear orders: Heuristics and a branch and bound algorithm, Rank-based choice correspondences, A prudent characterization of the ranked pairs rule, Methods for distance-based judgment aggregation, The complexity of Kemeny elections, An extension of the Moulin no show paradox for voting correspondences, Characteristic properties of list proportional representation systems, A distance-based comparison of basic voting rules, A conflict analysis approach for illuminating distributional issues in sustainability policy, A characterization of the prudent order preference function, Dimensions of election procedures: Analyses and comparisons, Research in decision theory: A personal perspective, Tournament methods in choice theory, On the use of ordered sets in problems of comparison and consensus of classifications, Voting schemes for which it can be difficult to tell who won the election, Three practical criteria of comparison among ordinal preference aggregating rules, A branch and bound algorithm for the acyclic subgraph problem, The median procedure in cluster analysis and social choice theory, Arrow's theorem: Unusual domains and extended codomains, Characterizations of the plurality function, Consensus sequences based on plurality rule, Preferences, agreement, consensus -- measuring, aggregation and control --, On the consistency of the plurality rule consensus function for molecular sequences, Discrete analysis of expert information. Research trends, The median procedure on median graphs, Choosing from a weighted tournament, The impact of indifferent voters on the likelihood of some voting paradoxes, The median procedure for n-trees, The median procedure in the semilattice of orders, An approach to formalization and analysis of group choice problems, The asymptotic plurality rule for molecular sequences, On the probability that all decision rules select the same winner, Characterizing best-worst voting systems in the scoring context, Consensus functions and patterns in molecular sequences, A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules, Complexity and the geometry of voting, Consistency without neutrality in voting rules: When is a vote an average?, An efficient approach for the rank aggregation problem, Distances and consensus rankings, Discrete Mathematics in Voting and Group Choice, Hybrid Elections Broaden Complexity-Theoretic Resistance to Control, Unnamed Item, A multivariate solution of the multivariate ranking and selection problem