We examine the maximal-element rationalizability of choice functions with arbitrary domains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier literature, this is not the case for maximal-element rationalizability, except when it coincides with greatest-element rationalizability because of properties imposed on the rationalizing relation. We develop necessary and sufficient conditions for maximal-element rationalizability by itself, and for maximal-element rationalizability in conjunction with additional properties of a rationalizing relation such as reflexivity, completeness, P-acyclicity, quasi-transitivity, consistency and ...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
Financial support through grants from the Social Sciences and Humanities Research Council of Canada,...
We examine the maximal-element rationalizability of choice functions with arbitrary do-mains. While ...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
On analyzing the problem that arises whenever the set of maximal elements is large, and a selection ...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
June 2002Financial support through grants from the Social Sciences and Humanities Research Council o...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
In the literature related to choice theory an important problem which has been dealt at length is th...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
Although the theory of greatest-element rationalizability and maximal-element rationalizability unde...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
Financial support through grants from the Social Sciences and Humanities Research Council of Canada,...
We examine the maximal-element rationalizability of choice functions with arbitrary do-mains. While ...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
On analyzing the problem that arises whenever the set of maximal elements is large, and a selection ...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
June 2002Financial support through grants from the Social Sciences and Humanities Research Council o...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
In the literature related to choice theory an important problem which has been dealt at length is th...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
Although the theory of greatest-element rationalizability and maximal-element rationalizability unde...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...
This paper generalizes rationalizability of a choice function by a single acyclic binary relation to...