The following pages link to Computing the minimal covering set (Q943589):
Displaying 24 items.
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- Minimal covering set solutions (Q733808) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- A new algorithm to find the smallest committee containing a given set of players (Q1102212) (← links)
- Dutta's minimal covering set and Shapley's saddles (Q1815205) (← 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)
- The complexity of minimum difference cover (Q2458927) (← links)
- Efficiently computing minimal sets of critical pairs (Q2643557) (← 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)
- Constructing Minimal Coverability Sets (Q2968530) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Algorithms and Computation (Q5897901) (← links)
- A note on the McKelvey uncovered set and Pareto optimality (Q5964644) (← links)
- A natural adaptive process for collective decision-making (Q6565779) (← links)
