Pages that link to "Item:Q2568818"
From MaRDI portal
The following pages link to Banks winners in tournaments are difficult to recognize (Q2568818):
Displaying 24 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView (Q383785) (← links)
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- Minimal stable sets in tournaments (Q634517) (← links)
- Computing the minimal covering set (Q943589) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- Extending tournament solutions (Q1616754) (← links)
- Margin of victory for tournament solutions (Q2060724) (← 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)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
