Pages that link to "Item:Q964822"

The following pages link to A computational analysis of the tournament equilibrium set (Q964822):

Displaying 17 items.

• The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
• Minimal retentive sets in tournaments (Q483107) (← links)
• Minimal stable sets in tournaments (Q634517) (← links)
• The minimal covering set in large tournaments (Q656810) (← links)
• Still more on the tournament equilibrium set (Q733772) (← links)
• Computing the minimal covering set (Q943589) (← links)
• On the structure of stable tournament solutions (Q1707316) (← links)
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
• Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
• Minimal extending sets in tournaments (Q2406936) (← links)
• The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
• A counterexample to a conjecture of Schwartz (Q2452120) (← links)
• A note on contestation-based tournament solutions (Q2453439) (← links)
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
• The Computational Complexity of Choice Sets (Q3392310) (← links)
• Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox (Q5053688) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)