Pages that link to "Item:Q1107402"

The following pages link to Covering sets and a new Condorcet choice correspondence (Q1107402):

Displaying 50 items.

• The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
• Renegotiation perfection in infinite games (Q457872) (← links)
• Dynamic coalitional equilibrium (Q533100) (← 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 computational complexity of weak saddles (Q647484) (← links)
• The minimal covering set in large tournaments (Q656810) (← links)
• Rank-based choice correspondences (Q673207) (← links)
• A new monotonicity condition for tournament solutions (Q708800) (← links)
• Minimal covering set solutions (Q733808) (← links)
• On the tournament equilibrium set (Q750267) (← links)
• Dynamic stable set as a tournament solution (Q892846) (← links)
• Cyclic tournaments and cooperative majority voting: A solution (Q912750) (← links)
• Computing the minimal covering set (Q943589) (← 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)
• Uncovered set choice rules (Q1024770) (← links)
• Choosing from a large tournament (Q1024772) (← links)
• A survey on the complexity of tournament solutions (Q1042317) (← links)
• Choosing from a tournament (Q1089228) (← links)
• Weak covering relations (Q1342391) (← links)
• The Copeland measure of Condorcet choice functions (Q1343145) (← links)
• Condorcet choice correspondences: A set-theoretical comparison (Q1377475) (← links)
• Choosing from a weighted tournament (Q1575093) (← links)
• Bounds for mixed strategy equilibria and the spatial model of elections (Q1599828) (← links)
• Distributive politics and electoral competition (Q1599829) (← links)
• The supercovering relation, the pairwise winner, and more missing links between Borda and Condorcet (Q1704412) (← links)
• On the structure of stable tournament solutions (Q1707316) (← links)
• Coalitional stability with a credibility constraint (Q1867798) (← links)
• Representation in majority tournaments (Q1964740) (← links)
• King-chicken choice correspondences (Q2108774) (← links)
• Majority-approval social choice (Q2165624) (← links)
• Tournament solutions based on cooperative game theory (Q2178642) (← links)
• Von Neumann-Morgenstern stable set rationalization of choice functions (Q2202240) (← links)
• Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
• Minimal extending sets in tournaments (Q2406936) (← links)
• A new old solution for weak tournaments (Q2450153) (← links)
• A counterexample to a conjecture of Schwartz (Q2452120) (← links)
• Weakened WARP and top-cycle choice rules (Q2468509) (← 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)
• Extremal Restriction, Condorcet Sets, and Majority Decision Making (Q2787397) (← links)
• The Computational Complexity of Choice Sets (Q3392310) (← links)
• Some Remarks on Dodgson's Voting Rule (Q3392311) (← links)
• Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)
• A note on the McKelvey uncovered set and Pareto optimality (Q5964644) (← links)
• An ordinal minimax theorem (Q5964692) (← links)
• Rational stability of choice functions (Q6053637) (← links)