A Generalization of Sen’s Unification Theorem: Avoiding the Necessity of Pairs and Triplets
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.
|Date of creation:||10 Nov 2011|
|Date of revision:|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Amartya K. Sen, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Oxford University Press, vol. 38(3), pages 307-317.
- Taradas Bandyopadhyay, 1988. "Revealed Preference Theory, Ordering and the Axiom of Sequential Path Independence," Review of Economic Studies, Oxford University Press, vol. 55(2), pages 343-351.
- Kotaro Suzumura, 1976. "Rational Choice and Revealed Preference," Review of Economic Studies, Oxford University Press, vol. 43(1), pages 149-158.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:37094. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.