Mostra el registre parcial de l'element Apesteguia, Jose Ballester, Miguel A.
dc.contributor.other Universitat Pompeu Fabra. Departament d'Economia i Empresa 2017-07-26T10:50:05Z 2017-07-26T10:50:05Z 2007-09-01
dc.description.abstract 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.
dc.language.iso eng
dc.relation.ispartofseries Economics and Business Working Papers Series; 1048
dc.rights 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
dc.title On the complexity of rationalizing behavior
dc.type info:eu-repo/semantics/workingPaper 2017-07-23T02:11:20Z
dc.subject.keyword rationalization
dc.subject.keyword computational complexity
dc.subject.keyword np-complete
dc.subject.keyword arbitrary choice domains
dc.subject.keyword Microeconomics
dc.rights.accessRights info:eu-repo/semantics/openAccess

Aquest element apareix en la col·lecció o col·leccions següent(s)

Mostra el registre parcial de l'element