How frequently do different voting rules encounter voting paradoxes in three-candidate elections?
Florenz PlassmannT. Nicolaus TidemanPublished in: Soc. Choice Welf. (2014)
Keyphrases
- voting rules
- computational social choice
- scoring rules
- social choice
- np hard
- computationally hard
- partial order
- special case
- computational complexity
- winner determination
- np hardness
- single peaked
- weighted majority
- cartesian product
- pairwise comparisons
- single agent
- information retrieval
- multi agent
- association rules
- mechanism design
- approximation algorithms
- lower bound