Condorcet Social Choice Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Informational requirements of social choice rules
- Choosing from a large tournament
- A survey on the complexity of tournament solutions
- Dimensions of election procedures: Analyses and comparisons
- Research in decision theory: A personal perspective
- Metric rationalisation of social choice functions according to principles of social choice
- Choosing from a tournament
- Consensus-based partitions in the space of ordered partitions
- Concorcet's principle implies the no show paradox
- Covering sets and a new Condorcet choice correspondence
- Voting games, indifference, and consistent sequential choice rules
- Induced social welfare functions
- Voting schemes for which it can be difficult to tell who won the election
- Three practical criteria of comparison among ordinal preference aggregating rules
- Monotonicity paradoxes in the theory of elections
- Majority efficiencies for simple voting procedures: Summary and interpretation
- The median procedure in cluster analysis and social choice theory
- On fuzzy tournaments and their solution concepts in group decision making
- Consensus sequences based on plurality rule
- Extending Condorcet's rule
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- A Borda measure for social choice functions
- Fuzzy sets and decision analysis
- The Copeland measure of Condorcet choice functions
- Monotonicity of single-seat preferential election rules
- Condorcet choice correspondences: A set-theoretical comparison
- On two new social choice correspondences.
- Choosing from a weighted tournament
- Bounds for mixed strategy equilibria and the spatial model of elections
- Distributive politics and electoral competition
- On the tradeoff between efficiency and strategyproofness
- Revisiting the connection between the no-show paradox and monotonicity
- Optimal bounds for the no-show paradox via SAT solving
- The supercovering relation, the pairwise winner, and more missing links between Borda and Condorcet
- An iterative approach for achieving consensus when ranking a finite set of alternatives by a group of experts
- Iterative ranking aggregation using quality improvement of subgroup ranking
- On the approximability of Dodgson and Young elections
- Consistent union and prioritized consistent union: new operations for preference aggregation
- A comparison of some distance-based choice rules in ranking environments
- Consensus system for solving conflicts in distributed systems
- The stability set as a social choice correspondence.
- On a compromise social choice correspondence
- The Dodgson ranking and the Borda count: a binary comparison
- On the probability that all decision rules select the same winner
- On strategy-proofness and single-peakedness: median-voting over intervals
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem
- How to choose a fair delegation?
- King-chicken choice correspondences
- Generalized medians and a political center
- Voting theory in the Lean theorem prover
- A theoretical examination of the ranked choice voting procedure
- Majority-approval social choice
- Characterization of tie-breaking plurality rules
- Weighted representative democracy
- Tournament solutions based on cooperative game theory
- Combinatorial \(n\)-fold integer programming and applications
- An axiomatic characterization of the Slater rule
- The solution of generalized stable sets and its refinement
- Daunou's voting rule and the lexicographic assignment of priorities
- How frequently do different voting rules encounter voting paradoxes in three-candidate elections?
- Dominating, weakly stable, and uncovered sets: properties and generalizations
- Condorcet consistency and the strong no show paradoxes
- Bounds on the disparity and separation of tournament solutions
- On stable rules for selecting committees
- Possible winner problems on partial tournaments: a parameterized study
- The traveling group problem
- Consistency without neutrality in voting rules: When is a vote an average?
- Defining the Borda count in a linguistic decision making context
- Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule
- An axiomatic characterization of the Borda mean rule
- On the selection of the same winner by all scoring rules
- Uncovered sets
- In quest of the Banks set in spatial voting games
- Robustness against inefficient manipulation
- Weakened WARP and top-cycle choice rules
- Social choice and electoral competition in the general spatial model
- Borda and condorcet: Some distance results
- Aggregation of binary evaluations: a Borda-like approach
- A refinement of the uncovered set in tournaments
- Informational requirements of social choice rules to avoid the Condorcet loser: a characterization of the plurality with a runoff
- A survey on the linear ordering problem for weighted or unweighted tournaments
- An analytical and experimental comparison of maximal lottery schemes
- Strategyproof social choice when preferences and outcomes may contain ties
- Deriving consensus in multiagent systems
- In the beginning there were n agents: founding and amending a constitution
- A characterization of the generalized optimal choice set through the optimization of generalized weak utilities
- On the reversal bias of the minimax social choice correspondence
- Computational Aspects of Approval Voting
- Representative democracy and the implementation of majority-preferred alternatives
- Studies in Computational Aspects of Voting
- A consideration of different definitions of fuzzy covering relations
- scientific article; zbMATH DE number 6099704 (Why is no real title available?)
- Discrete Mathematics in Voting and Group Choice
- The Computational Complexity of Choice Sets
- ON GROUP DECISION MAKING UNDER LINGUISTIC ASSESSMENTS
- Varieties of failure of monotonicity and participation under five voting methods
- A multivariate solution of the multivariate ranking and selection problem
- Are Condorcet procedures so bad according to the reinforcement axiom?
- A topological characterization of the existence of non-empty choice sets
- Internal slackening scoring methods
This page was built for publication: Condorcet Social Choice Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146476)