Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace:

On the complexity of rationalizing behavior
Apesteguia, Jose; Ballester, Miguel A.
Universitat Pompeu Fabra. Departament d'Economia i Empresa
We study the complexity of rationalizing choice behavior. We do so by analyzing two polar cases, and a number of intermediate ones. In our most structured case, that is where choice behavior is defined in universal choice domains and satisfies the "weak axiom of revealed preference," finding the complete preorder rationalizing choice behavior is a simple matter. In the polar case, where no restriction whatsoever is imposed, either on choice behavior or on choice domain, finding the complete preordersthat rationalize behavior turns out to be intractable. We show that the task of finding the rationalizing complete preorders is equivalent to a graph problem. This allows the search for existing algorithms in the graph theory literature, for the rationalization of choice.
computational complexity
arbitrary choice domains
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons
Documento de trabajo

Mostrar el registro completo del ítem