Pages that link to "Item:Q912750"

The following pages link to Cyclic tournaments and cooperative majority voting: A solution (Q912750):

Displaying 33 items.

• Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
• Internal slackening scoring methods (Q430913) (← links)
• Minimal retentive sets in tournaments (Q483107) (← links)
• A social choice theory of legitimacy (Q537545) (← links)
• Minimal stable sets in tournaments (Q634517) (← links)
• Set-rationalizable choice and self-stability (Q634537) (← links)
• The minimal covering set in large tournaments (Q656810) (← links)
• Rank-based choice correspondences (Q673207) (← links)
• Still more on the tournament equilibrium set (Q733772) (← links)
• On the tournament equilibrium set (Q750267) (← links)
• Set-monotonicity implies Kelly-strategyproofness (Q904832) (← links)
• A computational analysis of the tournament equilibrium set (Q964822) (← 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)
• Choosing from a large tournament (Q1024772) (← links)
• A survey on the complexity of tournament solutions (Q1042317) (← links)
• Weak covering relations (Q1342391) (← links)
• The Copeland measure of Condorcet choice functions (Q1343145) (← links)
• Condorcet choice correspondences: A set-theoretical comparison (Q1377475) (← links)
• Ranking by outdegree for directed graphs (Q1408881) (← links)
• On two new social choice correspondences. (Q1420528) (← links)
• Extending tournament solutions (Q1616754) (← links)
• On the structure of stable tournament solutions (Q1707316) (← links)
• Representation in majority tournaments (Q1964740) (← links)
• Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
• Minimal extending sets in tournaments (Q2406936) (← links)
• A counterexample to a conjecture of Schwartz (Q2452120) (← links)
• A note on contestation-based tournament solutions (Q2453439) (← links)
• A refinement of the uncovered set in tournaments (Q2633439) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
• Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox (Q5053688) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)