85 research outputs found
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.Rational Choice, Quasi-Transitivity, Acyclicity, Base Domains
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.Le problème de la « rationalisabilité » d’une fonction de choix à l’aide d’une relation de préférence transitive a été étudié en détail dans la littérature. En revanche, peu de résultats existent lorsque la relation sous-jacente n’est que quasi transitive ou acyclique. Nous décrivons les relations entre ces différentes formes de « rationalisabilité ». Nous identifions des conditions suffisantes et des conditions nécessaires qui sont valides pour tout domaine. Nous présentons des conditions nécessaires et suffisantes quand le domaine de la fonction de choix comprend tous les singletons et toutes les paires d’options d’un ensemble de référence
Maximal-Element Rationalizability
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, quasitransitivity, consistency and transitivity.Choice Functions, Maximal-Element Rationalizability
External Norms and Rationality of Choice
Ever since Sen (1993) criticized the notion of internal consistency of choice, there exists a widespread perception that the standard rationalizability approach to the theory of choice has difficulties in coping with the existence of external norms. We introduce a concept of norm-conditional rationalizability and show that external norms can be made compatible with the methods underlying the rationalizability approach. This claim is substantiated by characterizing norm-conditional rationalizability by means of suitably modified revealed preference axioms in the theory of rational choice on general domains due to Richter (1966; 1971) and Hansson (1968).
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.Rational Choice, Consistency, Binary 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
Choice by lexicographic semiorders
In Tversky's (1969) model of a lexicographic semiorder, preference is generated by the sequential application of numerical criteria, by declaring an alternative x better than an alternative y if the first criterion that distinguishes between x and y ranks x higher than y by an amount exceeding a fixed threshold. We generalize this idea to a fully-fledged model of boundedly rational choice. We explore the connection with sequential rationalizability of choice (Apesteguia and Ballester 2009, Manzini and Mariotti 2007), and we provide axiomatic characterizations of both models in terms of observable choice data.Lexicographic semiorders, bounded rationality, revealed preference, choice
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
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
- …