Signed orders in linear and nonlinear utility theory

Self-reflecting signed orders on a set A and its anti-set A ^* were introduced previously as a way to account for negative as well as positive feelings about the inclusion of items in A in potential subsets of choice. The present paper extends the notion of signed orders to lotteries on A A ^*, describes reflection axioms for the lottery context, and shows how these axioms simplify utility representations for preference between lotteries. The simplified representations are then used to guide procedures for extending preferences from A A ^* and its lotteries to preferences between subsets of items.     

Echelons in Incomplete Relations

An efficient method of value assessment of a set of exchangeable alternatives A = {a ₁,a ₂, ,a _n} is presented. It particularly applies to situations where certain preferences may be easily evaluated or are already known, while other binary comparisons may not at once be available. Further applications are to ranking partial tournaments and the emergence and the characterisation of organisational hierarchy. By sequentially performing transitively efficient assessments of uncompared pairs, an initial weakly acyclical preference structure in A is transformed into an ordering of A in echelons. We call these nicely surveyable preference structures echelon orders. Theoretical properties of echelon orders are investigated, including a characterisation and a numerical representation.     

An additive representation on the product of complete,continuous extensive structures

This article develops an axiom system to justify an additive representation for a preference relation \({\succsim}\) on the product \({\prod_{i=1}^{n}A_{i}}\) of extensive structures. The axiom system is basically similar to the n-component (n ≥ 3) additive conjoint structure, but the independence axiom is weakened in the system. That is, the axiom exclusively requires the independence of the order for each of single factors from fixed levels of the other factors. The introduction of a concatenation operation on each factor A _i makes it possible to yield a special type of restricted solvability, i.e., additive solvability and the usual cancellation on \({\prod_{i=1}^{n}A_{i}}\). In addition, the assumption of continuity and completeness for A _i implies a stronger type of solvability on A _i . The additive solvability, cancellation, and stronger solvability axioms allow the weakened independence to be effective enough in constructing the additive representation.     

When an Event Makes a Difference

For (S, Σ) a measurable space, let and be convex, weak^* closed sets of probability measures on Σ. We show that if ∪ satisfies the Lyapunov property , then there exists a set A ∈ Σ such that min_μ1∈ μ₁(A) > max_μ2 ∈ (A). We give applications to Maxmin Expected Utility (MEU) and to the core of a lower probability.     

Sequential voting by veto: Making the Mueller-Moulin algorithm more versatile

This paper shows that a relatively easy algorithm for computing the (unique) outcome of a sophisticated voting procedure called sequential voting by veto (SVV) applies to a more general situation than considered hitherto. According to this procedure a sequence of n voters must select s out of m + s options (s > 0, m 3 n 3 2). The ith voter, when his turn comes, vetoes k _i options (k _i 1, k _i = m). The s remaining non-vetoed options are selected. Every voter is assumed to be fully informed of all other voters total (linear) preference orderings among the competing options, as well as of the order in which the veto votes are cast. This algorithm was proposed by Mueller (1978) for the special case where s and the k _i are all equal to 1, and extended by Moulin (1983) to the somewhat more general case where the k _i are arbitrary but s is still 1. Some theoretical and practical issues of voting by veto are discussed.     

A formulation of the determinism hypothesis

The author tries to formulate what a determinist believes to be true. The formulation is based on some concepts defined in a systems-theoretical manner, mainly on the concept of an experiment over the sets A ^m (a set of m-tuples of input values) and B ⁿ (a set of n-tuples of output values) in the time interval (t ₁, ..., t _k ) (symbolically E[t ₁,..., t _k , A ^m , B ⁿ ]), on the concept of a behavior of the system S ^m,n (=(A ^m , B ⁿ )) on the basis of the experiment E[t ₁, ..., t _k , A ^m , B ⁿ ] and, indeed, on the concept of deterministic behavior .... The resulting formulation of the deterministic hypothesis shows that this hypothesis expresses a belief that we always could find some hidden parameters.     

Changes in preference

A basic framework for studies of changes in preference is introduced, and four types of changes in preference are identified.Revision by a sentence such as A is better thanB means that a preference forA overB is acquired. The result ofcontraction by A is better thanB is that the subject no longer holdsA to be better thanB. Inaddition andsubtraction, an alternative is added to, or subtracted from, respectively, the set of alternatives that are under consideration. Formal models of these four types of change are introduced, and they are shown to satisfy plausible postulates for rational changes in preferences.     

A note on “Re-examining the law of iterated expectations for Choquet decision makers”

This note completes the main result of Zimper (Theory and decision, doi:10.1007/s11238-010-9221-8, 2010), by showing that additional conditions are needed in order the law of iterated expectations to hold true for Choquet decision makers. Due to the comonotonic additivity of Choquet expectations, the equation E[f, ν(dω)] = E[E[f(ω _{i, j} ), ν(A _{i, j} |A _i )], ν(A _i )], is valid only when the act f is comonotonic with its dynamic form, that we name “conditional certainty equivalent act”.     

Second-order probabilities and belief functions

A second-order probability Q(P) may be understood as the probability that the true probability of something has the value P. True may be interpreted as the value that would be assigned if certain information were available, including information from reflection, calculation, other people, or ordinary evidence. A rule for combining evidence from two independent sources may be derived, if each source i provides a function Q _i (P). Belief functions of the sort proposed by Shafer (1976) also provide a formula for combining independent evidence, Dempster's rule, and a way of representing ignorance of the sort that makes us unsure about the value of P. Dempster's rule is shown to be at best a special case of the rule derived in connection with second-order probabilities. Belief functions thus represent a restriction of a full Bayesian analysis.     

Predictive superiority of the beta-characteristic function in cooperative non-sidepayment N-person games

This article reports an experimental study of decision-making outcomes in cooperative non-sidepayment games. The objective of this test was to determine which characteristic function, V (S) or V (S), provides the most accurate basis for payoff predictions from solution concepts. The experiment tested three solution concepts (core, stable set, imputation set) in the context of 5-person, 2-strategy non-sidepayment games. Predictions from each of the three solution concepts were computed on the basis of both V (S) and V (S), making a total of six predictive theories under test. Consistent with earlier studies (Michener et al., 1984a; Michener et al., 1985), two basic findings emerged. First, the data show that for each of the solutions tested, the prediction from any solution concept computed from V(S) was more accurate than the prediction from the same solution concept computed from V (S). Second, the -core was the most accurate of the six theories tested. Overall, these results support the view that V (S) is superior to V (S) as a basis for payoff predictions in cooperative non-sidepayment games.     

On Stalnaker's Notion of Strong Rationalizability and Nash Equilibrium in Perfect Information Games

Counterexamples to two results by Stalnaker (Theory and Decision, 1994) are given and a corrected version of one of the two results is proved. Stalnaker's proposed results are: (1) if at the true state of an epistemic model of a perfect information game there is common belief in the rationality of every player and common belief that no player has false beliefs (he calls this joint condition strong rationalizability), then the true (or actual) strategy profile is path equivalent to a Nash equilibrium; (2) in a normal-form game a strategy profile is strongly rationalizable if and only if it belongs to C , the set of profiles that survive the iterative deletion of inferior profiles.     

Inferring a linear ordering over a power set

An observer attempts to infer the unobserved ranking of two ideal objects, A and B, from observed rankings in which these objects are `accompanied' by `noise' components, C and D. In the first ranking, A is accompanied by C and B is accompanied by D, while in the second ranking, A is accompanied by D and B is accompanied by C. In both rankings, noisy-A is ranked above noisy-B. The observer infers that ideal-A is ranked above ideal-B. This commonly used inference rule is formalized for the case in which A,B,C,D are sets. Let X be a finite set and let be a linear ordering on 2^X. The following condition is imposed on . For every quadruple (A,B,C,D)Y, where Y is some domain in (2^X)⁴, if and , then . The implications and interpretation of this condition for various domains Y are discussed.     

Similarity and preferences in the space of simple lotteries

A. Rubinstein's similarity-relation approach to decision making under uncertainty is extended by introducing a new concept of correlated similarity relations. It is shown that every expected utility preference is consistent with the -difference similarity relation on the prize space and some correlated similarity relations on the probability space, and that a similarity relation on the prize space and correlated similarity relations on the probability space overdetermine the preference (in A. Rubinstein's sense).Earlier versions were presented at the Edwin Smart Symposium on Games and Economic Behavior, Ohio State University, 1989, the ESEM 1989 Meeting, the EEA 1989 Meeting, the Workshop on Rational and Boundedly Rational Principles of Strategic Behavior, Universität Bielefeld, 1989, and the ASSET 1991 Meeting. We wish to thank the comments received from the participants in those meetings and the stimulating suggestions of S. Ch. Kolm, R. D. Luce, and an anonymous referee. Financial support from the Universidad del Pais Vasco-Euskal Herriko Unibertsitatea, DGCYT (PS 87-0039) and Gobierno de Navarra are gratefully acknowledged.     

The general relevance of the impossibility teorem in smooth social choice

A complete classification theorem for voting processes on a smooth choice spaceW of dimensionw is presented. Any voting process is classified by two integersv ^* () andw(), in terms of the existence or otherwise of the optima set, IO(), and the cycle set IC().In dimension belowv ^* () the cycle set is always empty, and in dimension abovew() the optima set is nearly always empty while the cycle set is open dense and path con nected. In the latter case agenda manipulation results in any outcome.For admissible (compact, convex) choice spaces, the two sets are related by the general equilibrium result that IO() union IC() is non-empty. This in turn implies existence of optima in low dimensions. The equilibrium theorem is used to examine voting games with an infinite electorate, and the nature ofstructure induced equilibria, induced by jurisdictional restrictions.This material is based on work supported by a Nuffield Foundation grant.     

Separating marginal utility and probabilistic risk aversion

This paper is motivated by the search for one cardinal utility for decisions under risk, welfare evaluations, and other contexts. This cardinal utility should have meaningprior to risk, with risk depending on cardinal utility, not the other way around. The rank-dependent utility model can reconcile such a view on utility with the position that risk attitude consists of more than marginal utility, by providing a separate risk component: a probabilistic risk attitude towards probability mixtures of lotteries, modeled through a transformation for cumulative probabilities. While this separation of risk attitude into two independent components is the characteristic feature of rank-dependent utility, it had not yet been axiomatized. Doing that is the purpose of this paper. Therefore, in the second part, the paper extends Yaari's axiomatization to nonlinear utility, and provides separate axiomatizations for increasing/decreasing marginal utility and for optimistic/pessimistic probability transformations. This is generalized to interpersonal comparability. It is also shown that two elementary and often-discussed properties — quasi-convexity (aversion) of preferences with respect to probability mixtures, and convexity (pessimism) of the probability transformation — are equivalent.     

Piecewise linear rank-dependent utility

Choice under risk is modelled using a piecewise linear version of rank-dependent utility. This model can be considered a continuous version of NEO-expected utility (Chateauneuf et al., J Econ Theory 137:538–567, 2007). In a framework of objective probabilities, a preference foundation is given, without requiring a rich structure on the outcome set. The key axiom is called complementary additivity.     

Mean variance preferences and the heat equation

Chipman (1979) proves that for an expected utility maximizer choosing from a domain of normal distributions with mean and variance ² the induced preference functionV(, ) satisfies a differential equation known as the heat equation. The purpose of this note is to provide a generalization and simple proof of this result which does not depend on the normality assumption.     

The relationship between individual expectations and behaviors: Mortality expectations and smoking decisions

Using data from the Health and Retirement Study, we assess the accuracy of subjective beliefs about mortality and objectively estimated probabilities for individuals in the same sample. Overall, subjective beliefs and objective probabilities are very close. However, there are differences conditional on behaviors, with current smokers being relatively optimistic and never smokers relatively pessimistic in their assessments. In the aggregate, individuals accurately predict longevity, but at the individual level, subjective beliefs provide information in addition to the estimated objective probabilities in predicting actual events, which may arise from the effect of past or anticipated decisions on these beliefs.

A Microeconometric Test of Alternative Stochastic Theories of Risky Choice

The random preference, Fechner (or white noise), and constant error (or tremble) models of stochastic choice under risk are compared. Various combinations of these approaches are used with expected utility and rank-dependent theory. The resulting models are estimated in a random effects framework using experimental data from two samples of 46 subjects who each faced 90 pairwise choice problems. The best fitting model uses the random preference approach with a tremble mechanism, in conjunction with rank-dependent theory. As subjects gain experience, trembles become less frequent and there is less deviation from behaviour consistent with expected utility theory.