The following pages link to Computing the minimal covering set (Q943589):
Displayed 14 items.
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Uncovered sets (Q2453411) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- A note on the McKelvey uncovered set and Pareto optimality (Q5964644) (← links)