A characterization of sequential rationalizability

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rationalizable choice. Further, our characterization result provides a novel tool with which to study how other behavioral concepts are related to sequential rationalizability, and establish a priori unexpected implications. In particular, we show that the concept of rationalizability by game trees, which, in principle, had little to do with sequential rationalizability, is a refinement of the latter. Every choice function that is rationalizable by a game tree is also sequentially rationalizable. Finally, we show that some prominent voting mechanisms are also sequentially rationalizable.

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.

Welfare Maximizing Contest Success Functions when the Planner Cannot Commit

We analyze how a contest organizer chooses optimally the winner when the contestants' efforts are already exerted and commitment to the use of a given contest success function is not possible. We de…ne the notion of rationalizability in mixed-strategies to capture such a situation. Our approach allows to derive different contest success functions depending on the aims and attitudes of the decider. We derive contest success functions which are closely related to commonly used functions providing new support for them. By taking into account social welfare considerations our approach bridges the contest literature and the recent literature on political economy. Keywords: Endogenous Contests, Contest Success Function, Mixed-Strategies. JEL Classi…cation: C72 (Noncooperative Games), D72 (Economic Models of Political Processes: Rent-Seeking, Elections), D74 (Conflict; Conflict Resolution; Alliances)

Choice by sequential procedures

We propose a rule of decision-making, the sequential procedure guided byroutes, and show that three influential boundedly rational choice models can be equivalentlyunderstood as special cases of this rule. In addition, the sequential procedure guidedby routes is instrumental in showing that the three models are intimately related. We showthat choice with a status-quo bias is a refinement of rationalizability by game trees, which, inturn, is also a refinement of sequential rationalizability. Thus, we provide a sharp taxonomyof these choice models, and show that they all can be understood as choice by sequentialprocedures.

Notes on stochastic choice

A general formalism on stochastic choice is presented. Tje Rationalizability and Recoverability (Identification) problems are discussed. For the identification issue parametric examples are analyzed by means of techniques of mathematical tomography (Random transforms).

On some geometry and equivalence classes of normal form games

Equivalence classes of normal form games are defined using the geometryof correspondences of standard equilibiurm concepts like correlated, Nash,and robust equilibrium or risk dominance and rationalizability. Resultingequivalence classes are fully characterized and compared across differentequilibrium concepts for 2 x 2 games. It is argued that the procedure canlead to broad and game-theoretically meaningful distinctions of games aswell as to alternative ways of viewing and testing equilibrium concepts.Larger games are also briefly considered.

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)