The following pages link to (Q3757648):
Displaying 14 items.
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Prudent \(k\)-choice functions: Properties and algorithms (Q690087) (← links)
- Approximability of Dodgson's rule (Q1024774) (← links)
- A characterization of the prudent order preference function (Q1042325) (← links)
- Choosing from a weighted tournament (Q1575093) (← links)
- The Dodgson ranking and the Borda count: a binary comparison (Q1887443) (← links)
- An analysis of random elections with large numbers of voters (Q2127897) (← links)
- Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences (Q2146734) (← links)
- A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules (Q2381455) (← links)
- An axiomatic characterization of the Borda mean rule (Q2417426) (← links)
- An analytical and experimental comparison of maximal lottery schemes (Q2667570) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting (Q6494745) (← links)
- An impossibility theorem concerning positive involvement in voting (Q6498749) (← links)
