Arrow's Theorem with a fixed feasible alternative
- 32 Downloads
Arrow's Theorem, in its social choice function formulation, assumes that all nonempty finite subsets of the universal set of alternatives is potentially a feasible set. We demonstrate that the axioms in Arrow's Theorem, with weak Pareto strengthened to strong Pareto, are consistent if it is assumed that there is a prespecified alternative which is in every feasible set. We further show that if the collection of feasible sets consists of all subsets of alternatives containing a prespecified list of alternatives and if there are at least three additional alternatives not on this list, replacing nondictatorship by anonymity results in an impossibility theorem.
Unable to display preview. Download preview PDF.