A Consistent Extension of Condorcet’s Election Principle
From MaRDI portal
Publication:4166483
Cited in
(only showing first 100 items - show all)- 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
- Cosine similarity and the Borda rule
- Non-compensatory composite indicators for the evaluation of urban planning policy: the Land-Use Policy Efficiency Index (LUPEI)
- Axiomatic characterization of committee scoring rules
- 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
- Node classification over bipartite graphs through projection
- \textsc{Electre-Score}: a first outranking based method for scoring actions
- Is the preference of the majority representative?
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem
- An axiomatic re-characterization of the Kemeny rule
- Approval voting under dichotomous preferences: a catalogue of characterizations
- The median rule in judgement aggregation
- A linear ordering problem of sets
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- An axiomatic characterization of the Slater rule
- Characterizing best-worst voting systems in the scoring context
- Solidarity and efficiency in preference aggregation: a tale of two rules
- The Borda rule and the pairwise-majority-loser revisited
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
- A probabilistic evaluation framework for preference aggregation reflecting group homogeneity
- Majority rule in the absence of a majority
- A new approach for identifying the Kemeny median ranking
- Multidimensional welfare rankings under weight imprecision: a social choice perspective
- On stable rules for selecting committees
- 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?
- A partial taxonomy of judgment aggregation rules and their properties
- An axiomatic characterization of the Borda mean rule
- Strategy-proof preference aggregation: possibilities and characterizations
- Weighted distances between preferences
- Popular ranking
- A measure of distance between judgment sets
- On relative egalitarianism
- Assent-maximizing social choice
- Voting rules as statistical estimators
- An efficient approach for the rank aggregation problem
- Link prediction in multiplex networks
- Voting: a machine learning approach
- Computing kemeny rankings from d-Euclidean preferences
- Lazy Gale-Shapley for many-to-one matching with partial information
- An algorithmic view of voting
- Studies in Computational Aspects of Voting
- Partial kernelization for rank aggregation: theory and experiments
- Introduction to judgment aggregation
- Distances and consensus rankings
- Discrete Mathematics in Voting and Group Choice
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- scientific article; zbMATH DE number 3907591 (Why is no real title available?)
- A new characterization of simple majority
- Variable-population voting rules
- A multivariate solution of the multivariate ranking and selection problem
- The Condorcet set: majority voting over interconnected propositions
- Experiments with Kemeny ranking: What works when?
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- Independence of irrelevant alternatives revisited
- scientific article; zbMATH DE number 895060 (Why is no real title available?)
- Voting procedures, complexity of
- Extensions of the Young and Levenglick result about the inconsistency of Condorcet voting correspondences
- Median linear orders: Heuristics and a branch and bound algorithm
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- Strategyproof and efficient preference aggregation with Kemeny-based criteria
- 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
- Comparing multiagent systems research in combinatorial auctions and voting
- Mean-based Borda count for paradox-free comparisons of optimization algorithms
- Statistical ranking and combinatorial Hodge theory
- Maximum distance between Slater orders and Copeland orders of tournaments
- Bivariate scoring rules: unifying the characterizations of positional scoring rules and Kemeny's rule
- A natural adaptive process for collective decision-making
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
- An axiomatic characterization of Nash equilibrium
- Rank-based choice correspondences
This page was built for publication: A Consistent Extension of Condorcet’s Election Principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166483)