A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
From MaRDI portal
Publication:622582
DOI10.1007/s00355-010-0475-4zbMath1232.91185OpenAlexW2037412278MaRDI QIDQ622582
Publication date: 3 February 2011
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-010-0475-4
Related Items (31)
An analysis of random elections with large numbers of voters ⋮ Equilibria of Plurality Voting: Lazy and Truth-Biased Voters ⋮ Strategy-proofness of the randomized Condorcet voting system ⋮ Violations of Reversal Symmetry Under Simple and Runoff Scoring Rules ⋮ Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control ⋮ Voting theory in the Lean theorem prover ⋮ Characterization of tie-breaking plurality rules ⋮ A general method for deciding about logically constrained issues ⋮ A continuous rating method for preferential voting: the complete case ⋮ Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties ⋮ Equilibria in Doodle polls under three tie-breaking rules ⋮ The flow network method ⋮ Schulze voting as evidence carrying computation ⋮ Families of abstract decision problems whose admissible sets intersect in a singleton ⋮ Two characterizations of the dense rank ⋮ Decomposition of a decision-making problem into levels of preference of the majority graph ⋮ A note on the complexity of manipulating weighted Schulze voting ⋮ The supercovering relation, the pairwise winner, and more missing links between Borda and Condorcet ⋮ The nonmanipulative vote-deficits of voting rules ⋮ Unnamed Item ⋮ What shall we do with the cyclic profile? ⋮ A continuous rating method for preferential voting. The incomplete case ⋮ Social choice rules driven by propositional logic ⋮ A distributed social choice protocol for combinatorial domains ⋮ Consistency of scoring rules: a reinvestigation of composition-consistency ⋮ The clone relation of a binary relation ⋮ Some Remarks on Dodgson's Voting Rule ⋮ Representations of votes based on pairwise information: monotonicity versus consistency ⋮ The continuous maximum capacity path interdiction problem ⋮ Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner ⋮ Median for an odd number of linear order relations and its use in group choice problems
Uses Software
Cites Work
- Independence of clones as a criterion for voting rules
- Concorcet's principle implies the no show paradox
- Geometry of voting
- A continuous rating method for preferential voting. The incomplete case
- Approaches to Constructing a Stratified Merged Knowledge Base
- Condorcet Social Choice Functions
- Aggregation of Preferences with Variable Electorate
- Unnamed Item
- Unnamed Item
This page was built for publication: A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method