Minimal bools of rationales
Ver/
Fecha
2005Versión
Acceso abierto / Sarbide irekia
Tipo
Documento de trabajo / Lan gaiak
Impacto
|
nodoi-noplumx
|
Resumen
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 rationa ...
[++]
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. [--]
Materias
Rationalization,
Independence of irrelevant alternatives,
Order partition,
Computational effort
Serie
Documentos de Trabajo DE - ES Lan Gaiak /
0501
Departamento
Universidad Pública de Navarra. Departamento de Economía /
Nafarroako Unibertsitate Publikoa. Ekonomia Saila
Entidades Financiadoras
Financial support by the Spanish Commission of Science and Technology (CICYT, SEC2003-08105) is gratefully acknowledged.