Consistency of a binary relation requires any preference cycle to involve indifference only. It has been shown that consistency is necessary and sufficient for the existence of an ordering extension of a binary relation. It is therefore 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. All but one such notion are characterized for general domains, and all are characterized for domains that contain all two-element subsets of the universal set. Copyright (c) The London School of Economics and Political Science 2005.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 72 (2005)
Issue (Month): 286 (05)
|Contact details of provider:|| Postal: Houghton Street, London WC2A 2AE|
Phone: +44 (020) 7405 7686
Web page: http://www.blackwellpublishing.com/journal.asp?ref=0013-0427
More information through EDIRC
|Order Information:||Web: http://www.blackwellpublishing.com/subs.asp?ref=0013-0427|
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.:
- Walter Bossert & Yves Sprumont & Kotaro Suzumura, 2006.
"Rationalizability of choice functions on general domains without full transitivity,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 27(3), pages 435-458, December.
- 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.
- 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, 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.
- Kotaro Suzumura, 1976. "Rational Choice and Revealed Preference," Review of Economic Studies, Oxford University Press, vol. 43(1), pages 149-158.
- Suzumura, Kataro, 1976. "Remarks on the Theory of Collective Choice," Economica, London School of Economics and Political Science, vol. 43(172), pages 381-390, November.
- Amartya K. Sen, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Oxford University Press, vol. 38(3), pages 307-317. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:bla:econom:v:72:y:2005:i:286:p:185-200. 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: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.