The complexity of voter partition in Bucklin and fallback voting: solving three open problems.

Gábor Erdélyi Lena Piras Jörg Rothe

Published in: AAMAS (2011)

Keyphrases

open problems
voting rules
scoring rules
computational complexity
long standing
database theory
voting scheme
voting schemes
partial order
database
mobile robot
management system
np complete
orders of magnitude
computational advertising