A complementary approach to transitive rationalizability
In this article, we study the axiomatic foundations of revealed preference theory. We define two revealed relations from the weak and strong revealed preference. The alternative x is preferred to y with respect to U if x, being available in an admissible set implies, the rejecting of y; and x is preferred to y with respect to Q if the rejecting of x implies the rejecting of y. The purpose of the paper is to show that the strong axiom of revealed preference and Hansson's axiom of revealed preference can be given with the help of U and Q and their extension properties.
|Date of creation:||07 Dec 1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC
References listed on IDEAS
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.:
- Suzumura, Kataro, 1976. "Remarks on the Theory of Collective Choice," Economica, London School of Economics and Political Science, vol. 43(172), pages 381-90, November.
- Duggan, John, 1999. "A General Extension Theorem for Binary Relations," Journal of Economic Theory, Elsevier, vol. 86(1), pages 1-16, May.
- Suzumura, Kotaro, 1976. "Rational Choice and Revealed Preference," Review of Economic Studies, Wiley Blackwell, vol. 43(1), pages 149-58, February.
- Clark, Stephen A, 1985. "A Complementary Approach to the Strong and Weak Axioms of Revealed Preference," Econometrica, Econometric Society, vol. 53(6), pages 1459-63, November.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:20164. 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: (Ekkehart Schlicht)
If references are entirely missing, you can add them using this form.