Rationalizability of Choice Functions: Domain Conditions
Debabrata Pal
Abstract
Open-access reader
Debabrata Pal
Abstract
Open-access reader
In the literature related to choice theory an important problem which has been dealt with at length is the rationalizability of the choice function of an individual. In the literature a number of choice consistency conditions have been postulated which are proven to be necessary and sufficient for a choice function to have an ordering rationalization. In this paper a necessary and sufficient condition has been derived for the domain to be such that every possible choice function defined over the domain has an ordering rationalization.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the literature related to choice theory an important problem which has been dealt with at length is the rationalizability of the choice function of an individual. In the literature a number of choice consistency conditions have been postulated which are proven to be necessary and sufficient for a choice function to have an ordering rationalization. In this paper a necessary and sufficient condition has been derived for the domain to be such that every possible choice function defined over the domain has an ordering rationalization.
Key concepts: Rationalizability, Rationalization (economics), Choice function, Mathematical economics, Function (biology), Domain (mathematical analysis), Consistency (knowledge bases), Mathematics