A Consistent Extension of Condorcet’s Election Principle
From MaRDI portal
Publication:4166483
DOI10.1137/0135023zbMath0385.90010OpenAlexW2000851114MaRDI 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
Related Items
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, Distance on matchings: An axiomatic approach, Partition–Mallows Model and Its Inference for Rank Aggregation, Collective schedules: axioms and algorithms, Solving the Kemeny ranking aggregation problem with quantum optimization algorithms, Approximate Condorcet partitioning: solving large-scale rank aggregation problems, Mean-based Borda count for paradox-free comparisons of optimization algorithms, On stable rules for selecting committees, The median procedure in the semilattice of orders, Tournament methods in choice theory, Consensus functions and patterns in molecular sequences, Introduction to Judgment Aggregation, Preferences, agreement, consensus -- measuring, aggregation and control --, An extension of the Moulin no show paradox for voting correspondences, On the consistency of the plurality rule consensus function for molecular sequences, The median rule in judgement aggregation, Studies in Computational Aspects of Voting, A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules, On the use of ordered sets in problems of comparison and consensus of classifications, Cosine similarity and the Borda rule, Complexity and the geometry of voting, Consistency without neutrality in voting rules: When is a vote an average?, Characteristic properties of list proportional representation systems, An approach to formalization and analysis of group choice problems, Discrete analysis of expert information. Research trends, The asymptotic plurality rule for molecular sequences, A partial taxonomy of judgment aggregation rules and their properties, Voting schemes for which it can be difficult to tell who won the election, A linear ordering problem of sets, A new characterization of simple majority, Three practical criteria of comparison among ordinal preference aggregating rules, A distance-based comparison of basic voting rules, Variable-population voting rules, Voting: a machine learning approach, Non-compensatory composite indicators for the evaluation of urban planning policy: the Land-Use Policy Efficiency Index (LUPEI), A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings, An axiomatic characterization of the Borda mean rule, The median procedure on median graphs, Comparing multiagent systems research in combinatorial auctions and voting, The Condorcet set: majority voting over interconnected propositions, Distance rationalization of voting rules, Spatial implementation, Photo sequencing, Statistical ranking and combinatorial Hodge theory, Maximum distance between Slater orders and Copeland orders of tournaments, A branch and bound algorithm for the acyclic subgraph problem, Computing kemeny rankings from \(d\)-Euclidean preferences, Lazy Gale-Shapley for many-to-one matching with partial information, Experiments with Kemeny ranking: What works when?, Strategy-proof preference aggregation: possibilities and characterizations, The median procedure in cluster analysis and social choice theory, Weighted distances between preferences, Arrow's theorem: Unusual domains and extended codomains, Manipulation can be hard in tractable voting systems even for constant-sized coalitions, Popular ranking, A measure of distance between judgment sets, On relative egalitarianism, Assent-maximizing social choice, Voting rules as statistical estimators, Axiomatic characterization of committee scoring rules, Characterizations of the plurality function, On the probability that all decision rules select the same winner, Independence of irrelevant alternatives revisited, An axiomatic characterization of the Slater rule, Voting Procedures, Complexity of, Rank-based choice correspondences, Distances and consensus rankings, A conflict analysis approach for illuminating distributional issues in sustainability policy, Consensus sequences based on plurality rule, Discrete Mathematics in Voting and Group Choice, Unnamed Item, The impact of indifferent voters on the likelihood of some voting paradoxes, Extensions of the Young and Levenglick result about the inconsistency of Condorcet voting correspondences, Characterizing best-worst voting systems in the scoring context, An efficient approach for the rank aggregation problem, Median linear orders: Heuristics and a branch and bound algorithm, Solidarity and efficiency in preference aggregation: a tale of two rules, Partial Kernelization for Rank Aggregation: Theory and Experiments, The Borda rule and the pairwise-majority-loser revisited, Strategyproof and efficient preference aggregation with Kemeny-based criteria, A prudent characterization of the ranked pairs rule, Methods for distance-based judgment aggregation, Node classification over bipartite graphs through projection, Hybrid Elections Broaden Complexity-Theoretic Resistance to Control, \textsc{Electre-Score}: a first outranking based method for scoring actions, An Algorithmic View of Voting, The median procedure for n-trees, \(k\)-majority digraphs and the hardness of voting with a constant number of voters, Is the preference of the majority representative?, Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers, A probabilistic evaluation framework for preference aggregation reflecting group homogeneity, Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem, Unnamed Item, Choosing from a weighted tournament, Majority rule in the absence of a majority, A characterization of the prudent order preference function, A new approach for identifying the Kemeny median ranking, An axiomatic re-characterization of the Kemeny rule, Dimensions of election procedures: Analyses and comparisons, Approval voting under dichotomous preferences: a catalogue of characterizations, Research in decision theory: A personal perspective, A multivariate solution of the multivariate ranking and selection problem, Multidimensional welfare rankings under weight imprecision: a social choice perspective, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation, Link prediction in multiplex networks, The complexity of Kemeny elections
