The computational difficulty of manipulating an election

This publication has 12 references indexed in Scilit:

• Voting schemes for which it can be difficult to tell who won the election
  Social Choice and Welfare, 1989
• Choice and complexity
  Mathematical Social Sciences, 1987
• Problems of finding optimal voting and representation systems
  European Journal of Operational Research, 1986
• On effectively computable realizations of choice functions: Dedicated to Professors Kenneth J. Arrow and Anil Nerode
  Mathematical Social Sciences, 1985
• Voting Procedures: A Summary Analysis
  British Journal of Political Science, 1983
• Graph Theory
  Published by Springer Nature ,1979
• Manipulation of social choice functions
  Journal of Economic Theory, 1976
• The Choice of Voting Systems
  Scientific American, 1976
• Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions
  Journal of Economic Theory, 1975
• Manipulation of Voting Schemes: A General Result
  Econometrica, 1973