Weak Pseudo-Rationalizability

Download Edit this record How to cite View on PhilPapers
Abstract
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
STEWP-6
Revision history
Archival date: 2020-01-08
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2020-01-08

Total views
26 ( #44,222 of 46,294 )

Recent downloads (6 months)
26 ( #29,121 of 46,294 )

How can I increase my downloads?

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