Pages that link to "Item:Q975500"
From MaRDI portal
The following pages link to A note on the query complexity of the Condorcet winner problem (Q975500):
Displaying 5 items.
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
- Condorcet winner configurations of linear networks (Q3577841) (← links)
- Single-Elimination Brackets Fail to Approximate Copeland Winner. (Q5875465) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
- Beyond the worst case: semi-random complexity analysis of winner determination (Q6167260) (← links)