Composition-consistent tournament solutions and social choice functions
From MaRDI portal
Recommendations
Cited in
(26)- Sequential composition of voting rules in multi-issue domains
- On the functional completeness of simple tournaments
- On two new social choice correspondences.
- Representation in majority tournaments
- Consistency of scoring rules: a reinvestigation of composition-consistency
- Characterization of tie-breaking plurality rules
- Condorcet choice and the Ostrogorski paradox
- Deriving weights from general pairwise comparison matrices
- A continuous rating method for preferential voting. The incomplete case
- An analytical and experimental comparison of maximal lottery schemes
- New candidates welcome! Possible winners with respect to the addition of new candidates
- scientific article; zbMATH DE number 953000 (Why is no real title available?)
- Minimal retentive sets in tournaments
- scientific article; zbMATH DE number 895060 (Why is no real title available?)
- Multiple votes, multiple candidacies and polarization
- Rational stability of choice functions
- Tight bounds on 3-team manipulations in randomized death match
- Symmetric maximal Condorcet domains
- Bivariate scoring rules: unifying the characterizations of positional scoring rules and Kemeny's rule
- Some chance for consensus: voting methods for which consensus is an equilibrium
- Consistent social ranking solutions
- Rank-based choice correspondences
- Strategic voting in multi-winner elections with approval balloting: a theory for large electorates
- Hyper-stable collective rankings
- Set-monotonicity implies Kelly-strategyproofness
- Self-selective social choice functions
This page was built for publication: Composition-consistent tournament solutions and social choice functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906019)
