In binary choice between discrete outcome lotteries, an individual may prefer lottery L1 to lottery L2 when the probability that L1 delivers a better outcome than L2 is higher than the probability that L2 delivers a better outcome than L1. Such a preference can be rationalized by three standard axioms (solvability, convexity and symmetry) and one less standard axiom (a fanning-in). A preference for the most probable winner can be represented by a skew-symmetric bilinear utility function. Such a utility function (...) has the structure of a regret theory when lottery outcomes are perceived as ordinal and the assumption of regret aversion is replaced with a preference for a win. The empirical evidence supporting the proposed system of axioms is discussed. (shrink)

The relations between rationality and optimization have been widely discussed in the wake of Herbert Simon's work, with the common conclusion that the rationality concept does not imply the optimization principle. The paper is partly concerned with adding evidence for this view, but its main, more challenging objective is to question the converse implication from optimization to rationality, which is accepted even by bounded rationality theorists. We discuss three topics in succession: (1) rationally defensible cyclical choices, (2) the revealed preference (...) theory of optimization, and (3) the infinite regress of optimization. We conclude that (1) and (2) provide evidence only for the weak thesis that rationality does not imply optimization. But (3) is seen to deliver a significant argument for the strong thesis that optimization does not imply rationality. (shrink)

This paper will be concerned with hard choices—that is, choice situations where an agent cannot make a rationally justified choice. Specifically, this paper asks: if an agent cannot optimize in a given situation, are they facing a hard choice? A pair of claims are defended in light of this question. First, situations where an agent cannot optimize because of incompleteness of the binary preference or value relation constitute a hard choice. Second, situations where agents cannot optimize because the binary preference (...) or value relation violates acyclicity do not constitute a hard choice. (shrink)

The papers focuses on pragmatic arguments for various rationality constraints on a decision maker’s state of mind: on her beliefs or preferences. An argument of this kind typically targets constraint violations. It purports to show that a violator of a given constraint can be confronted with a decision problem in which she will act to her guaranteed disadvantage. Dramatically put, she can be exploited by a clever bookie who doesn’t know more than the agent herself. Examples of pragmatic arguments of (...) this kind are synchronic Dutch Books, for the standard probability axioms, diachronic Dutch Books, for the more controversial principles of reflection and conditionalization, and Money Pumps, for the acyclicity requirement on preferences. The paper suggests that the proposed exploitation set-ups share a common feature. If the violator of a given constraint is logically and mathematically competent, and if she prefers to be better off rather than worse off, she can be exploited only if she is disunified in her decision-making, i.e. only if she makes decisions on various issues she faces separately rather than jointly. Unification in decision making is relatively unproblematic in synchronic contexts, but it may be costly and inconvenient diachronically. On this view, therefore, pragmatic arguments should be seen as delivering conditional recommendations: If you want to afford disunification, then you’d better satisfy these constraints. They identify safeguards of a disunified mind. Isaac Levi’s position on these matters is diametrically different. According to Levi, only synchronic pragmatic arguments are valid. The diachronic ones, he argues, lack any validity at all. This line of reasoning is questioned in the paper. (shrink)

Larry Temkin challenged what seems to be an analytic truth about comparatives: if A is Φ-er than B and B is Φ-er than C, then, A is Φ-er than C. Ruth Chang denies a related claim: if A is Φ-er than B and C is not Φ-er than B, but is Φ to a certain degree, then A is Φ-er than C. In this paper I advance a context-sensitive semantics of gradability according to which the data uncovered by Temkin and (...) Chang leave both statements intact. (shrink)

Probably many people have cyclic preferences: they prefer A to B, B to C and C to A for some objects of choice A, B and C. Recent work has resurrected the objection to cyclic preference that agents possessing them are open to exploitation by means of ‘money pumps’. The paper briefly reviews this work and proposes a general approach to problems of sequential choice that makes cyclic preference immune to exploitation by means of these new mechanisms.

I argue that we can generate intransitive preference orderings for a single person on the model of Sen's Libertarian Paradox.

Hurwicz (Social Choice and public decision making. Essays in honor of Kenneth J. Arrow, Cambridge University Press, Cambridge, 1986) was the first to study an approach to implementation theory based on choice functions instead of preference relations. We argue that the solution concept used by him, the generalized Nash equilibrium, is not really compatible with the idea that individual behavior is describable by a choice function. A new solution concept that better fits the choice function framework is then introduced. Using (...) this, we investigate what behavioral assumptions are needed for the full characterizations of Nash implementable social choice correspondences to still hold. We will show that a condition known as Property α is central. (shrink)

A decision under ‘complete uncertainty’ is one where the decision maker knows the set of possible outcomes for each decision, but cannot assign probabilities to those outcomes. This way, the problem of ranking decisions is reduced to a problem of ranking sets of outcomes. All rankings that have emerged in the literature in this domain imply transitivity. In the current study, transitivity is subjected to an empirical evaluation in two experiments, where subjects are asked to choose between sets of monetary (...) consequences. After analysis with a Bayes Factor, very few violations of transitivity were found. It can be concluded that transitivity seems a plausible condition for the ranking of sets of monetary consequences. (shrink)

What makes a choice difficult, beyond being complex or difficult to calculate? Characterizing difficult choices as posing a special challenge to the agent, and as typically involving consequences of significant moment as well as clashes of values, the article proceeds to compare the way difficult choices are handled by rational choice theory and by the theory that preceded it, Kurt Lewin's "conflict theory." The argument is put forward that within rational choice theory no choice is in principle difficult: if the (...) object is to maximize some value, the difficulty can be at most computational. Several prototypes of choices that challenge this argument are surveyed and discussed ; special attention is given to difficult choices faced by doctors and layers. The last section discusses a number of devices people employ in their attempt to cope with difficult choices: escape, "reduction" to non-difficult choices, and second-order strategies. (shrink)

This French paper is a preliminary version of P. Mongin, "Does Optimization Imply Rationality?", Synthese, 124, 2000, p. 73-111, to which readers are referred to.