Voting Rules from Random Relations
From MaRDI portal
Recommendations
- Voting rules as statistical estimators
- Voting in combinatorial domains
- Choice by multirelations and the approval voting rule
- Voting matrices and tie-breaking
- Optimal voting rules
- Voting rules as error-correcting codes
- Dynamically consistent voting rules
- Voting rules that are unbiased but not transitive-symmetric
- Probabilistic Borda rule voting
- Rationalizations of Voting Rules
Cited in
(11)- Voting rules that are unbiased but not transitive-symmetric
- The Efron dice voting system
- Recognition of relations by the method of collective vote
- A simple voting scheme generates all binary relations on finite sets
- scientific article; zbMATH DE number 3993236 (Why is no real title available?)
- Elections generate all binary relations on infinite sets
- Voting with a Logarithmic Number of Cards
- Random Walks and Voting Theory
- Independence of clones as a criterion for voting rules
- Stochastic same-sidedness in the random voting model
- A distance-based comparison of basic voting rules
This page was built for publication: Voting Rules from Random Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999239)
