Rationalizing Choice Functions by Multiple Rationales
AbstractThe paper presents a notion of rationalizing choice functions that violate the “Independence of Irrelevant Alternatives” axiom. A collection of linear orderings is said to provide a rationalization by multiple rationales for a choice function if the choice from any choice set can be rationalized by one of the orderings. We characterize a tight upper bound on the minimal number of orderings that is required to rationalize arbitrary choice functions, and calculate the minimal number for several specific choice procedures.
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 The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp278.
Length: 9 pages
Date of creation: Oct 2001
Date of revision:
Publication status: Published in Econometrica, 2002, vol. 70, pp. 2481-2488.
Other versions of this item:
- Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November.
- Gil Kalai & Ariel Rubenstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Economics Working Papers 0010, Institute for Advanced Study, School of Social Science.
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.:
- McFadden, Daniel, 1999.
"Rationality for Economists?,"
Journal of Risk and Uncertainty,
Springer, vol. 19(1-3), pages 73-105, December.
- Sen, Amartya, 1993. "Internal Consistency of Choice," Econometrica, Econometric Society, vol. 61(3), pages 495-521, May.
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: (Ilan Nehama).
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.