Pages that link to "Item:Q1042317"
From MaRDI portal
The following pages link to A survey on the complexity of tournament solutions (Q1042317):
Displayed 5 items.
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← 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)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)