Abstract
In the context of ranking infinite utility streams, the impartiality axiom of finite length anonymity requires the equal ranking of any two utility streams that are equal up to a finite length permutation ( Fleurbaey and Michel, 2003). We first characterize any finite length permutation as a composition of a fixed step permutation and an “almost” fixed step permutation. We then show that if a binary relation satisfies finite length anonymity, then it violates all the distributional axioms that are based on a segment-wise comparison. Examples of those axioms include the weak Pareto principle and the weak Pigou-Dalton principle.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
