Login / Signup
Control complexity in Bucklin and fallback voting: A theoretical analysis.
Gábor Erdélyi
Michael R. Fellows
Jörg Rothe
Lena Schend
Published in:
J. Comput. Syst. Sci. (2015)
Keyphrases
</>
theoretical analysis
complexity analysis
scoring rules
computational complexity
worst case
numerical simulations
control system
computational cost
voting schemes
information retrieval
keywords
cooperative
multi agent systems
np hard
voting rules