Pages that link to "Item:Q964822"
From MaRDI portal
The following pages link to A computational analysis of the tournament equilibrium set (Q964822):
Displayed 11 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)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← 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)
- The Computational Complexity of Choice Sets (Q3392310) (← links)