Weak Pseudo-Rationalizability

Mathematical Social Sciences 104:23-28 (2020)
Download Edit this record How to cite View on PhilPapers
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to rationalizability by a set of such relations. Rather than selecting those options in a menu that are maximal with respect to a single binary relation, a weakly pseudo-rationalizable choice function selects those options that are maximal with respect to at least one binary relation in a given set. I characterize the class of weakly pseudo-rationalizable choice functions in terms of simple functional properties. This result also generalizes Aizerman and Malishevski's characterization of pseudo-rationalizable choice functions, that is, choice functions rationalizable by a set of total orders.
PhilPapers/Archive ID
Upload history
Archival date: 2020-01-08
View other versions
Added to PP index

Total views
208 ( #34,295 of 69,982 )

Recent downloads (6 months)
26 ( #32,543 of 69,982 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.