Eliminating the Weakest Link: Making Manipulation Intractable?

AAAI, 2012.

Cited by: 17|Bibtex|Views10
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting rules used in practice, the computational complexity increases. For example, it is already known th...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments