Weak Pseudo-Rationalizability

Mathematical Social Sciences 104:23-28 (2020)
  Copy   BIBTEX

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.

Author's Profile

Rush T. Stewart
King's College London

Analytics

Added to PP
2020-01-08

Downloads
463 (#32,431)

6 months
99 (#35,316)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?