2026-04-18T01:27:23Zhttps://recercat.cat/oai/request

oai:recercat.cat:10230/5422025-12-17T01:46:44Zcom_2072_6col_2072_452953

On the complexity of rationalizing behavior Apesteguía, José Ballester, Miguel A. Universitat Pompeu Fabra. Departament d'Economia i Empresa rationalization computational complexity np-complete arbitrary choice domains Microeconomics 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 preorders that 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. 2017-07-26T10:50:05Z 2017-07-26T10:50:05Z 2007-09-01 2017-07-23T02:11:20Z info:eu-repo/semantics/workingPaper https://econ-papers.upf.edu/ca/paper.php?id=1048 http://hdl.handle.net/10230/542 eng Economics and Business Working Papers Series; 1048 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 http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess application/pdf application/pdf