Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call