Social choice and computational complexity

Jerry S. Kelly

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

May's conditions characterizing simple majority voting are used to determine what sets of properties force social choice rules to be computable and what sets of properties still permit uncomputable rules. The techniques used also allow discussion of degrees of computational complexity within the class of computable rules.

Original languageEnglish (US)
Pages (from-to)1-8
Number of pages8
JournalJournal of Mathematical Economics
Volume17
Issue number1
DOIs
StatePublished - 1988

ASJC Scopus subject areas

  • Economics and Econometrics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Social choice and computational complexity'. Together they form a unique fingerprint.

Cite this