Rationalizability of Choice Functions on General Domains without Full Transitivity

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of the rationalizing relation. Furthermore, we discuss sufficient conditions and necessary conditions for rational choice on arbitrary domains. Transitive, quasi-transitive, and acyclical rationalizability are fully characterized for domains that contain all singletons and all two-element subsets of the universal set.

Consistent Rationalizability

Consistency of a binary relation requires any preference cycle to involve indifference only. As shown by Suzumura (1976b), consistency is necessary and sufficient for the existence of an ordering extension of a relation. Because of this important role of consistency, it is of interest to examine the rationalizability of choice functions by means of consistent relations. We describe the logical relationships between the different notions of rationalizability obtained if reflexivity or completeness are added to consistency, both for greatest-element rationalizability and for maximal-element rationalizability. All but one notion of consistent rationalizability are characterized for general domains, and all of them are characterized for domains that contain all two-element subsets of the universal set.

Maximal-Element Rationalizability

We examine the maximal-element rationalizability of choice functions with arbitrary do-mains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier litera-ture, 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 rationaliz-ability by itself, and for maximal-element rationalizability in conjunction with additional properties of a rationalizing relation such as re exivity, completeness, P-acyclicity, quasi-transitivity, consistency and transitivity.

Top-Cycle Rationalizability

We identify necessary and sufficient conditions for the choice set from every subset A of a (finite) universal set X to coincide with the top cycle in A of some fixed tournament on X.

Non-Deteriorating Choice

We analyze an alternative to the standard rationalizability requirement for observed choices by considering non-deteriorating selections. A selection function is a generalization of a choice function where selected alternatives may depend on a reference (or status quo) alternative in addition to the set of feasible options. A selection function is non-deteriorating if there exists an ordering over the universal set of alternatives such that the selected alternatives are at least as good as the reference option. We characterize non-deteriorating selection functions in an abstract framework and in an economic environment.

Efficient and Non-Deteriorating Choice

We analyze collective choice procedures with respect to their rationalizability by means of profiles of individual preference orderings. A selection function is a generalization of a choice function where selected alternatives may depend on a reference (or status quo) alternative in addition to the set of feasible options. Given the number of agents n, a selection function satisfies efficient and non-deteriorating n-rationalizability if there exists a profile of n orderings on the universal set of alternatives such that the selected alternatives are (i) efficient for that profile, and (ii) at least as good as the reference option according to each individual preference. We analyze efficient and non-deteriorating collective choice in a general abstract framework and provide a characterization result given a universal set domain.

Rational Choice on Arbitrary Domains: A Comprehensive Treatment

The rationalizability of a choice function on arbitrary domains by means of a transitive relation has been analyzed thoroughly in the literature. Moreover, characterizations of various versions of consistent rationalizability have appeared in recent contributions. However, not much seems to be known when the coherence property of quasi-transitivity or that of P-acyclicity is imposed on a rationalization. The purpose of this paper is to fill this significant gap. We provide characterizations of all forms of rationalizability involving quasi-transitive or P-acyclical rationalizations on arbitrary domains.

Domain Closedness Conditions and Rational Choice

The rationalizability of a choice function on an arbitrary domain under various coherence properties has received a considerable amount of attention both in the long-established and in the recent literature. Because domain closedness conditions play an important role in much of rational choice theory, we examine the consequences of these requirements on the logical relationships among different versions of rationalizability. It turns out that closedness under intersection does not lead to any results differing from those obtained on arbitrary domains. In contrast, closedness under union allows us to prove an additional implication.

Consistent Relations

Consistency, a natural weakening of transitivity introduced in a seminal contribution by Suzumura (1976b), has turned out to be an interesting and promising concept in a variety of areas within economic theory. This paper summarizes its recent applications and provides some new observations in welfarist social choice and in population ethics. In particular, it is shown that the conclusion of the welfarism theorem remains true if transitivity is replaced by consistency and that an impossibility result in variable-population social-choice theory turns into a possibility if transitivity is weakened to consistency.

Social Norms and Rationality of Choice

Ever since Sen (1993) criticized the notion of internal consistency of choice, there exists a wide spread perception that the standard rationalizability approach to the theory of choice has difficulties coping with the existence of external social norms. This paper introduces a concept of norm-conditional rationalizability and shows that external social norms can be accommodated so as to be compatible with norm-conditional rationalizability by means of suitably modified revealed preference axioms in the theory of rational choice on general domains à la Richter (1966;1971) and Hansson (1968)

Non-Deteriorating Choice without Full Transitivity

Although the theory of greatest-element rationalizability and maximal-element rationalizability under general domains and without full transitivity of rationalizing relations is well-developed in the literature, these standard notions of rational choice are often considered to be too demanding. An alternative definition of rationality of choice is that of non-deteriorating choice, which requires that the chosen alternatives must be judged at least as good as a reference alternative. In game theory, this definition is well-known under the name of individual rationality when the reference alternative is construed to be the status quo. This alternative form of rationality of individual and social choice is characterized in this paper on general domains and without full transitivity of rationalizing relations.

Single-Peaked Choice

Single-peaked preferences have played an important role in the literature ever since they were used by Black (1948) to formulate a domain restriction that is sufficient for the exclusion of cycles according to the majority rule. In this paper, we approach single-peakedness from a choice-theoretic perspective. We show that the well-known axiom independence of irrelevant alternatives (a form of contraction consistency) and a weak continuity requirement characterize a class of single-peaked choice functions. Moreover, we examine the rationalizability and the rationalizability-representability of these choice functions.

Rationality, External Norms and the Epistemic Value of Menus

Ever since Sen’s (1993; 1997) criticism on the notion of internal consistency or menu independence of choice, there exists a widespread perception that the standard revealed preference approach to the theory of rational choice has difficulties in coping with the existence of external norms, or the information a menu of choice might convey to a decision-maker, viz., the epistemic value of a menu. This paper provides a brief survey of possible responses to these criticisms of traditional rational choice theory. It is shown that a novel concept of norm-conditional rationalizability can neatly accommodate external norms within the standard framework of rationalizability theory. Furthermore, we illustrate that there are several ways of incorporating considerations regarding the epistemic value of opportunity sets into a generalized model of rational choice theory.

Revealed Preference and Choice under Uncertainty

We employ the theory of rational choice to examine whether observable choices from feasible sets of prospects can be generated by the optimization of some underlying decision criterion under uncertainty. Rather than focusing on a specific theory of choice, our objective is to formulate a general approach that is designed to cover the various decision criteria that have been proposed in the literature. We use a mild dominance property to define a class of suitable choice criteria. In addition to rationalizability per se, we characterize transitive and Suzumura consistent rationalizability in the presence of dominance.