Munich Personal RePEc Archive

A Generalization of Sen’s Unification Theorem: Avoiding the Necessity of Pairs and Triplets

He, Junnan (2011): A Generalization of Sen’s Unification Theorem: Avoiding the Necessity of Pairs and Triplets.

[img]
Preview
PDF
MPRA_paper_37094.pdf

Download (376kB) | Preview

Abstract

This paper is concerned with the axiomatic foundation of the revealed preference theory. Many well-known results in literature rest upon the ability to choose over budget sets that contains only 2 or 3 elements, the situations which are not observable in real life. In order to give a more realistic approach, this paper shows that many of the famous consistency requirements, such as those proposed by Arrow, Sen, Samuelson etc., are equivalent if the domain of choice functions satisfy some set theoretical properties. And these properties, unions and inclusions for example, are proposed in a way that gives observability.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.