Pages that link to "Item:Q464615"
From MaRDI portal
The following pages link to Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615):
Displaying 4 items.
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)