Rationalizing Choice Functions by Multiple Rationales
Gil Kalai (),
Ariel Rubenstein and
Ran Spiegler ()
Additional contact information
Gil Kalai: Institute of Mathematics, Hebrew University, Jerusalem
No 10, Economics Working Papers from Institute for Advanced Study, School of Social Science
Abstract:
The 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.
Pages: 8 pages
Date: 2001-10
References: View references in EconPapers View complete reference list from CitEc
Citations:
Published in Econometrica, Volume 70, November 2002, 2481-2488
Downloads: (external link)
http://www.sss.ias.edu/publications/papers/econpaperten.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www.sss.ias.edu/publications/papers/econpaperten.pdf [301 Moved Permanently]--> https://www.sss.ias.edu/publications/papers/econpaperten.pdf [301 Moved Permanently]--> https://www.ias.edu/sss/publications/papers/econpaperten.pdf)
Related works:
Journal Article: Rationalizing Choice Functions By Multiple Rationales (2002)
Working Paper: Rationalizing Choice Functions by Multiple Rationales (2001) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ads:wpaper:0010
Access Statistics for this paper
More papers in Economics Working Papers from Institute for Advanced Study, School of Social Science Contact information at EDIRC.
Bibliographic data for series maintained by Nancy Cotterman ().