AbstractConsistency of a binary relation requires any preference cycle to involve indifference only. As shown by Suzumura (1976b), consistency is necessary and sufficient for the existence of an ordering extension of a relation. Because of this important role of consistency, it is of interest to examine the rationalizability of choice functions by means of consistent relations. We describe the logical relationships between the different notions of rationalizability obtained if reflexivity or completeness are added to consistency, both for greatest-element rationalizability and for maximal-element rationalizability. All but one notion of consistent rationalizability are characterized for general domains, and all of them are characterized for domains that contain all two-element subsets of the universal set.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Center for Intergenerational Studies, Institute of Economic Research, Hitotsubashi University in its series Discussion Paper with number 82.
Length: 17 p.
Date of creation: Apr 2002
Date of revision:
Note: June 2002, Financial support through grants from the Social Sciences and Humanities Research Council of Canada, the Fonds pour la Formation de Chercheurs et l'Aide à la Recherche of Québec, and a Grant-in-Aid for Scientific Research for Priority Areas (B) Number 603 from the Ministry of Education, Science and Culture of Japan is gratefully acknowledged.
Contact details of provider:
Postal: 2-1 Naka, Kunitachi City, Tokyo 186-8603
Web page: http://cis.ier.hit-u.ac.jp/
More information through EDIRC
Rational Choice; Consistency; Binary Domains;
Other versions of this item:
- D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory
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.:
- Sen, Amartya K, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Wiley Blackwell, vol. 38(115), pages 307-17, July.
- BOSSERT, Walter & SPRUMONT, Yves & SUZUMURA, Kotaro, 2001.
"Rationalizability of Choice Functions on General Domains without Full Transitivity,"
Cahiers de recherche
2001-13, Universite de Montreal, Departement de sciences economiques.
- Walter Bossert & Yves Sprumont & Kotaro Suzumura, 2006. "Rationalizability of choice functions on general domains without full transitivity," Social Choice and Welfare, Springer, vol. 27(3), pages 435-458, December.
- Bossert, Walter & Sprumont, Yves & Suzumura, Kotaro, 2001. "Rationalizability of Choice Functions on General Domains Without Full Transitivity," Discussion Paper 28, Center for Intergenerational Studies, Institute of Economic Research, Hitotsubashi University.
- Bossert, W. & Sprumont, Y. & Suzumura, K., 2001. "Rationalizability of Choice Functions on General Domains without Full Transitivity," Cahiers de recherche 2001-13, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Suzumura, Kotaro, 1976. "Rational Choice and Revealed Preference," Review of Economic Studies, Wiley Blackwell, vol. 43(1), pages 149-58, February.
- 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.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Digital Resources Section, Hitotsubashi University Library).
If references are entirely missing, you can add them using this form.