Add to ORKGIn this paper we consider choice correspondences which may be empty-valued. We study conditions under which such choice correspondences are rational, transitively rational, partially rational, partially almost transitive rational, partially almost quasi-transitive rational
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
In this paper we consider choice correspondences which may be empty-valued. We study conditions unde...
In this paper we consider choice correspondences which may be empty-valued. We study conditions unde...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
We introduce a general method for identifying the sets of best alternatives of decision makers in ea...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
Although the theory of greatest-element rationalizability and maximal-element rationalizability unde...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
Although the theory of greatest-element rationalizability and maximal-element rationalizability unde...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
In this paper we consider choice correspondences which may be empty-valued. We study conditions unde...
In this paper we consider choice correspondences which may be empty-valued. We study conditions unde...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
We introduce a general method for identifying the sets of best alternatives of decision makers in ea...
The rationalizability of a choice function by means of a transitive relation has been analyzed thoro...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
Although the theory of greatest-element rationalizability and maximal-element rationalizability unde...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
Although the theory of greatest-element rationalizability and maximal-element rationalizability unde...
I introduce a general method for identifying choice correspondences experimentally, i.e., the sets o...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...
The rationalizability of a choice function on arbitrary domains by means of a transitive relation ha...