On The Complexity of Rationalizing Behavior

Miguel Ballester and Jose Apesteguia

No 320, Working Papers from Barcelona School of Economics

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.

Keywords: Rationalization; Computational complexity; NP-complete; arbitrary choice domains (search for similar items in EconPapers)
JEL-codes: D00 (search for similar items in EconPapers)
Date: 2015-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://bw.bse.eu/wp-content/uploads/2022/02/1320-file.pdf (application/pdf)

Related works:
Working Paper: On the complexity of rationalizing behavior (2007)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bge:wpaper:320

Access Statistics for this paper

More papers in Working Papers from Barcelona School of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Bruno Guallar ().