The following pages link to Condorcet Social Choice Functions (Q4146476):
Displaying 50 items.
- Aggregation of binary evaluations: a Borda-like approach (Q258936) (← links)
- A characterization of the generalized optimal choice set through the optimization of generalized weak utilities (Q272152) (← links)
- On the reversal bias of the minimax social choice correspondence (Q277309) (← links)
- Representative democracy and the implementation of majority-preferred alternatives (Q284362) (← links)
- Varieties of failure of monotonicity and participation under five voting methods (Q365799) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Are Condorcet procedures so bad according to the reinforcement axiom? (Q404755) (← links)
- A topological characterization of the existence of non-empty choice sets (Q409719) (← links)
- Internal slackening scoring methods (Q430913) (← links)
- On the construction of non-empty choice sets (Q431812) (← links)
- How hard is it to tell which is a Condorcet committee? (Q459394) (← links)
- Generalized Condorcet winners (Q483530) (← links)
- Resolute refinements of social choice correspondences (Q502364) (← links)
- On the solution of \(w\)-stable sets (Q502372) (← links)
- One-way monotonicity as a form of strategy-proofness (Q532698) (← links)
- A systematic approach to the construction of non-empty choice sets (Q535405) (← links)
- Undominated candidate strategies under alternative voting rules (Q583067) (← links)
- On the possibility of reasonable consistent majoritarian choice: Some positive results (Q593980) (← links)
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method (Q622582) (← links)
- Minimal stable sets in tournaments (Q634517) (← links)
- Set-rationalizable choice and self-stability (Q634537) (← links)
- General conditions for the existence of maximal elements via the uncovered set (Q660108) (← links)
- Approximating optimal social choice under metric preferences (Q668776) (← links)
- Rank-based choice correspondences (Q673207) (← links)
- Choosing among maximals (Q696933) (← links)
- Relationships between Borda voting and Zermelo ranking (Q733784) (← links)
- Methods for distance-based judgment aggregation (Q733803) (← links)
- Minimal covering set solutions (Q733808) (← links)
- On stable solutions to the ordinal social choice problem (Q736038) (← links)
- On the tournament equilibrium set (Q750267) (← links)
- SSB utility theory: An economic perspective (Q759613) (← links)
- An extension of the Moulin no show paradox for voting correspondences (Q836920) (← links)
- A distance-based comparison of basic voting rules (Q882604) (← links)
- Dynamic stable set as a tournament solution (Q892846) (← links)
- Level \(r\) consensus and stable social choice (Q904833) (← links)
- The informational basis of scoring rules (Q905166) (← links)
- Cyclic tournaments and cooperative majority voting: A solution (Q912750) (← links)
- How to choose a non-controversial list with \(k\) names (Q930481) (← links)
- Computing the minimal covering set (Q943589) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- Preference-based choice functions: a generalized approach (Q970094) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Characterization of dominance relations in finite coalitional games (Q993504) (← links)
- Informational requirements of social choice rules (Q1013515) (← links)
- Choosing from a large tournament (Q1024772) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- Dimensions of election procedures: Analyses and comparisons (Q1055323) (← links)
- Research in decision theory: A personal perspective (Q1056649) (← links)
- Metric rationalisation of social choice functions according to principles of social choice (Q1087454) (← links)
- Choosing from a tournament (Q1089228) (← links)
