Abstract
The idea of rationalizability of a choice function assumes considerable importance in the theory of consumer behaviour as well as in the theory of social choice. Rationalizability of a choice function ensures the existence of a binary relation such that, for every set in the domain of that choice function its choice set is the set of its best elements according to that same binary relation. In social choice theory the quest for rationalizability conditions for choice functions began with Uzawa (1956). Arrow (1959) characterized a choice function (with full domain) that is rationalizable by an ordering. Plott (1973) did the same for a reflexive, connected and quasi-transitive rationalization. Blair et al. (1976) found necessary and sufficient conditions for rationalization of a choice function with full domain by a reflexive, connected and acyclic binary relation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
