Pages that link to "Item:Q2386312"

The following pages link to Condorcet choice correspondences for weak tournaments (Q2386312):

Displaying 21 items.

• Can strategizing in round-robin subtournaments be avoided? (Q483532) (← links)
• Social choice without the Pareto principle under weak independence (Q485435) (← links)
• A social choice theory of legitimacy (Q537545) (← links)
• Hyper-stable collective rankings (Q900257) (← links)
• Computing the minimal covering set (Q943589) (← links)
• Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
• Choosing from a weighted tournament (Q1575093) (← links)
• Distributive politics and electoral competition (Q1599829) (← links)
• Extending tournament solutions (Q1616754) (← links)
• The supercovering relation, the pairwise winner, and more missing links between Borda and Condorcet (Q1704412) (← links)
• The impact of indifferent voters on the likelihood of some voting paradoxes (Q1763193) (← links)
• Characterizations of the 3-cycle count and backward length of a tournament (Q1767699) (← links)
• The stability set as a social choice correspondence. (Q1867836) (← links)
• Condorcet choice and the Ostrogorski paradox (Q2272188) (← links)
• The flow network method (Q2417378) (← links)
• A new old solution for weak tournaments (Q2450153) (← links)
• Uncovered sets (Q2453411) (← links)
• Social choice and electoral competition in the general spatial model (Q2490129) (← links)
• Does Choosing Committees from Approval Balloting Fulfill the Electorate’s Will? (Q2829680) (← links)
• A note on the McKelvey uncovered set and Pareto optimality (Q5964644) (← links)
• A solution for abstract decision problems based on maximum flow value (Q6589395) (← links)