The paradox of multiple elections
From MaRDI portal
Recommendations
Cited in
(52)- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Avoiding Anscombe's paradox
- Strategic voting in multi-winner elections with approval balloting: a theory for large electorates
- Aggregation of binary evaluations: a Borda-like approach
- Single-switch preferences and the Ostrogorski paradox
- Collective Choice May Tell Nothing About Anyone’s Individual Preferences
- Multi-attribute proportional representation
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Permutations of separable preference orders
- The complexity of Kemeny elections
- Principles of Talmudic logic
- German parliamentary elections 2009 from the viewpoint of direct democracy
- Introduction to judgment aggregation
- A concept of sincerity for combinatorial voting
- Single-peaked preferences over multidimensional binary alternatives
- Three ways to compute accurately the probability of the referendum paradox
- Pareto efficiency in multiple referendum
- Does choosing committees from approval balloting fulfill the electorate's will?
- Only a dictatorship is efficient
- Condorcet's paradox with three candidates
- How does separability affect the desirability of referendum election outcomes?
- Collective decision making
- Efficient and strategy-proof voting rules: A characterization
- Selecting predictors for traffic control by methods of the mathematical theory of democracy
- A theoretical examination of the ranked choice voting procedure
- Triple-consistent social choice and the majority rule
- A distributed social choice protocol for combinatorial domains
- On the Probability of the Ostrogorski Paradox
- SEQUENTIAL OR SIMULTANEOUS ELECTIONS? A WELFARE ANALYSIS
- Predicting DAX trends from Dow Jones data by methods of the mathematical theory of democracy
- Voting in Combinatorial Domains: What Logic and AI Have to Say
- The probability of conflicts in a U. S. presidential type election
- Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction
- Sequential composition of voting rules in multi-issue domains
- Evaluation of German parties and coalitions by methods of the mathematical theory of democracy
- Voting by eliminating quantifiers
- Yes-no voting
- Compromise in combinatorial vote
- Consequences of reversing preferences
- Voting on multi-issue domains with conditionally lexicographic preferences
- Ensuring Pareto optimality by referendum voting
- Separable discrete preferences
- Combinatorial voting
- The budget-voting paradox
- How majorities can lose the election: another voting paradox
- A mathematical model of Athenian democracy
- Complexity and the geometry of voting
- On the product knapsack problem
- A strong paradox of multiple elections
- Bribery in voting with CP-nets
- Unanimity and the Anscombe's paradox
- Condorcet choice and the Ostrogorski paradox
This page was built for publication: The paradox of multiple elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386269)
