Minimal Books Of Rationales
Kalai, Rubinstein, and Spiegler (2002) propose the rationalization of choice functions that violate the “independence of irrelevant alternatives” axiom through a collection (book) of linear orders (rationales). In this paper we present an algorithm which, for any choice function, gives (i) the minimal number of rationales that rationalizes the choice function, (ii) the composition of such rationales, and (iii) information on how choice problems are related to rationales. As in the classical case, this renders the information given by a choice function completely equivalent to that given by a minimal book of rationales. We also study the structure of several choice procedures that are prominent in the literature.
|Date of creation:||Feb 2005|
|Date of revision:|
|Publication status:||Published in|
|Contact details of provider:|| Postal: Campus de Arrosadía - 31006 Pamplona (Spain)|
Phone: 34 948 169340
Fax: 34 948 169 721
Web page: http://www.econ.unavarra.es
|Order Information:|| Postal: Papers are not sent in a centralized mode. You can download them with ftp, or contact the authors.|
When requesting a correction, please mention this item's handle: RePEc:nav:ecupna:'0501'. 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: (Javier Puértolas)
If references are entirely missing, you can add them using this form.