The following pages link to Minimal stable sets in tournaments (Q634517):
Displaying 17 items.
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- Set-rationalizable choice and self-stability (Q634537) (← links)
- Set-monotonicity implies Kelly-strategyproofness (Q904832) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Stable cores in information graph games (Q2078082) (← links)
- Tournament solutions based on cooperative game theory (Q2178642) (← links)
- Von Neumann-Morgenstern stable set rationalization of choice functions (Q2202240) (← 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)
- Minimal extending sets in tournaments (Q2406936) (← links)
- A counterexample to a conjecture of Schwartz (Q2452120) (← links)
- Uncovered sets (Q2453411) (← links)
- A refinement of the uncovered set in tournaments (Q2633439) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- Rational stability of choice functions (Q6053637) (← links)
- Characterizing the top cycle via strategyproofness (Q6076911) (← links)
