Affordable Access

From social welfare ordering to acyclic aggregation of preferences

Publication Date
  • Mathematics


One way to overcome Arrow's impossibility theorem is to drop the requirement that the collective preference be transitive. If it is quasi-transitive (strict preferences are transitive) an oligarchy emerges. If it is only acyclic, many non-oligarchic aggregation rules are available, yet the resulting decision rules are poorly decisive: Nakamura's theorem characterizes acyclic and neutral Arrowian aggregators. We propose a parallel characterization of acyclic and anonymous aggregation methods.

There are no comments yet on this publication. Be the first to share your thoughts.