The following pages link to Computing the minimal covering set (Q943589):
Displayed 5 items.
- 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)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)