Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners

DOI10.1007/11821069_46zbMath1132.91399OpenAlexW2621141976MaRDI QIDQ5756698

Hemaspaandra, Lane A., Christopher M. Homan

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://scholarworks.rit.edu/cgi/viewcontent.cgi?article=1683&context=article

Mathematics Subject Classification ID

Voting theory (91B12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ Generalized juntas and NP-hard sets ⋮ Copeland Voting Fully Resists Constructive Control ⋮ Parameterized Computational Complexity of Dodgson and Young Elections ⋮ Voting Procedures, Complexity of ⋮ Frequency of correctness versus average polynomial time

This page was built for publication: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners