Pages that link to "Item:Q1042317"
From MaRDI portal
The following pages link to A survey on the complexity of tournament solutions (Q1042317):
Displayed 13 items.
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Can strategizing in round-robin subtournaments be avoided? (Q483532) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- A graph interpretation of the least squares ranking method (Q2340263) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- A new old solution for weak tournaments (Q2450153) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)