Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules

Artificial Intelligence 217 (C):20-42 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Strategic Voting Under Uncertainty About the Voting Method.Wesley H. Holliday & Eric Pacuit - 2019 - Electronic Proceedings in Theoretical Computer Science 297:252–272.
Voting (Insincerely) in Corporate Law.Zohar Goshen - 2001 - Theoretical Inquiries in Law 2 (2).
Sincerity and manipulation under approval voting.Ulle Endriss - 2013 - Theory and Decision 74 (3):335-355.
Some Remarks on Dodgson's Voting Rule.Felix Brandt - 2009 - Mathematical Logic Quarterly 55 (4):460-463.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,316,802)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Author's Profile