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 language | English (US) |
|---|---|
| Pages (from-to) | 1-8 |
| Number of pages | 8 |
| Journal | Journal of Mathematical Economics |
| Volume | 17 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1988 |
ASJC Scopus subject areas
- Economics and Econometrics
- Applied Mathematics