The following pages link to The paradox of multiple elections (Q2386269):
Displaying 50 items.
- Aggregation of binary evaluations: a Borda-like approach (Q258936) (← links)
- Unanimity and the Anscombe's paradox (Q384521) (← links)
- Pareto efficiency in multiple referendum (Q430916) (← links)
- Triple-consistent social choice and the majority rule (Q456955) (← links)
- A distributed social choice protocol for combinatorial domains (Q524881) (← links)
- Three ways to compute accurately the probability of the referendum paradox (Q554497) (← links)
- Only a dictatorship is efficient (Q608534) (← links)
- Strategic voting in multi-winner elections with approval balloting: a theory for large electorates (Q682478) (← links)
- Avoiding Anscombe's paradox (Q794541) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Single-switch preferences and the Ostrogorski paradox (Q855755) (← links)
- How does separability affect the desirability of referendum election outcomes? (Q857660) (← links)
- Selecting predictors for traffic control by methods of the mathematical theory of democracy (Q877096) (← links)
- The budget-voting paradox (Q931428) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction (Q1037610) (← links)
- Evaluation of German parties and coalitions by methods of the mathematical theory of democracy (Q1038417) (← links)
- A mathematical model of Athenian democracy (Q1038704) (← links)
- Sequential composition of voting rules in multi-issue domains (Q1042318) (← links)
- Yes-no voting (Q1208123) (← links)
- The probability of conflicts in a U. S. presidential type election (Q1424208) (← links)
- On the product knapsack problem (Q1653266) (← links)
- Multi-attribute proportional representation (Q1731837) (← links)
- A theoretical examination of the ranked choice voting procedure (Q2151318) (← links)
- Compromise in combinatorial vote (Q2171851) (← links)
- Condorcet choice and the Ostrogorski paradox (Q2272188) (← links)
- Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- Efficient and strategy-proof voting rules: A characterization (Q2371154) (← links)
- A strong paradox of multiple elections (Q2386270) (← links)
- Complexity and the geometry of voting (Q2389766) (← links)
- A concept of sincerity for combinatorial voting (Q2417369) (← links)
- Ensuring Pareto optimality by referendum voting (Q2431824) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- German parliamentary elections 2009 from the viewpoint of direct democracy (Q2452128) (← links)
- Predicting DAX trends from Dow Jones data by methods of the mathematical theory of democracy (Q2464247) (← links)
- Separable discrete preferences (Q2486167) (← links)
- Permutations of separable preference orders (Q2492224) (← links)
- How majorities can lose the election: another voting paradox (Q2568817) (← links)
- Single-peaked preferences over multidimensional binary alternatives (Q2636803) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Does Choosing Committees from Approval Balloting Fulfill the Electorate’s Will? (Q2829680) (← links)
- Combinatorial voting (Q2859052) (← links)
- Introduction to Judgment Aggregation (Q3166990) (← links)
- Principles Of Talmudic Logic (Q3305655) (← links)
- SEQUENTIAL OR SIMULTANEOUS ELECTIONS? A WELFARE ANALYSIS (Q3459209) (← links)
- Voting in Combinatorial Domains: What Logic and AI Have to Say (Q3532453) (← links)
- Collective Choice May Tell Nothing About Anyone’s Individual Preferences (Q4991776) (← links)
- On the Probability of the Ostrogorski Paradox (Q5053689) (← links)
- Collective decision making (Q6602233) (← links)
