Random Rank-Dependent Expected Utility

We present a novel characterization of random rank-dependent expected utility for finite datasets and finite prizes. The test lends itself to statistical testing using the tools in Kitamura and Stoye (2018).


Introduction
The rank-dependent expected utility (RDEU) model, first proposed by Quiggin (1982), is one of the main alternatives to the expected utility (EU) model.RDEU is popular because it extends EU to accommodate known empirical anomalies that violate the predictions of EU (e.g., Allais Paradox) while at the same time it produces sharp comparative statics and preserves transitivity (Quiggin, 1991).
The RDEU model extends EU by allowing cumulative probabilities of lotteries to be weighted by a weighting function.This means that RDEU does not rely on the independence axiom.1 According to Quiggin (1991), RDEU is EU with respect to a transformed probability distribution.Formally, we say a decision maker (DM) that can be described by a RDEU ranks lottery p over lottery q if and only if there exist a (Bernoulli) utility function u and a weighting where prizes x k are ranked by some primitive order and we use convention that 0 t=1 p t = 0.
Here we study the empirical implications of RDEU when we observe a cross-section of choices, from a finite collection of menus and lotteries, made by DMs that follow the RDEU rule.Since we allow the primitives of RDEU to be heterogeneous among the DMs (e.g., random φ and random u) we call this model of population behavior Random Rank-Dependent Expected Utility (RRDEU).We fully characterize the RRDEU model and provide a statistical test of it using the tools in Kitamura and Stoye (2018) (henceforth KS).
As a byproduct of our characterization of RRDEU in a finite stochastic choice dataset (limited stochastic dataset), we provide a characterization of random expected utility (REU).
The characterization of REU is the first of its type for limited stochastic datasets.The seminal work of Gul and Pesendorfer (2006) (henceforth GP) characterizing the REU for an infinite stochastic dataset may provide false positives when applied to a limited stochastic dataset.The two main axioms in the GP characterization are regularity and independence.
Regularity requires that the probability of choosing a lottery weakly decreases as the number of alternatives in a menu grows.Independence in GP requires that if we expand a menu A by mixing all the lotteries inside it with an outside lottery r, then the probability of choice of the mixture lotteries in the new menu is the same as the probability of choice of the original ones.
The problem with the characterization in GP is that if we have only 3 menus that are not ranked by the set inclusion relation and are not related by the mixture operations required by the independence assumption in GP, the axioms are trivially satisfied.However, we will show that even with 3 menus such as the ones we have described there are still empirical properties of REU that may fail showing that the test in GP fails for limited stochastic choice dataset.
Example 1 (Counterexample to Gul and Pesendorfer (2006)). .Consider three lotteries {p, q, p ′ = αp + (1 − α)r}, and we observe three menus {p, q}, {p ′ , q}, {p ′ , p} such that ρ {p,q} (p) = 1, ρ {p ′ ,p} (p ′ ) > 0 and ρ {p ′ ,q} (p ′ ) = 0 (where ρ A (a) denotes the probability of choosing a in menu A).We can observe that the axioms of independence and regularity of GP are trivially satisfied.However, for any fixed α > 0, it has to be if the DMs can be described by EU behavior, then ρ {p ′ ,q} (p ′ ) > 0. The reason is that for the given restrictions on ρ, there is at least one expected utility function U with positive mass, such that U(r) > U(p) > U(q), which means that ρ {p ′ ,q} (p ′ ) > 0. This means that this limited stochastic dataset is inconsistent with REU.
The previous example shows that the test in GP fails when we consider a limited stochastic dataset.Since EU is a special case of RDEU this is also a problem for the latter.Indeed similar issues will appear in GP's style characterizations of RRDEU.Our results provide a fix for this issue.The intuition behind our test is that for any linear order on the set of finite lotteries, we can uncover whether there is u and φ that can describe this order and, hence, make it consistent with RDEU.If the answer to the previous question is affirmative, then we can use that linear order as the support of a random utility rule.We show that this test can be done using a simple quadratic program in the case of RRDEU that simplifies to a linear program in the case of REU.
Since we have characterized the empirical content of RRDEU that has a natural population interpretation, our tests can be used in experimental and field datasets that have a crosssection of choices with limited menu variation.Finally, since our test lends itself to statistical testing it can deal with sampling variability which is not the case of GP.To the best of our knowledge no other work has provided a characterization and statistical test for RRDEU in a cross-section of choices.The closest work to ours is by Polisson, Quah and Renou (2020) that provides a nonparametric test of EU and RDEU for a setup with linear budgets and a time series of choices from the same individual in contrast to our cross-section setup.
In Section 2, we describe our setup and formally define the RRDEU.In Section 3, we provide a construction of the set of all linear orders consistent with RDEU for a given finite set of lotteries and establish the main theoretical result.In Section 4, we apply our method to an experimental dataset.Finally, we conclude in Section 5.

Model
We consider a finite set of distinct alternatives Let ∆(X) be the set of all lotteries (distributions) defined on X and Π ⊆ ∆(X) be a finite subset of it.Let A ⊆ 2 Π \ {∅} be a collection of menus of lotteries.
The probabilistic choice rules are ρ A ∈ ∆(A), where A ∈ A and ∆(A) is the simplex defined on menu A. A stochastic choice dataset is ρ = (ρ A ) A∈A .The set of all linear orders on Definition 1 (Random Utility, RU).We say that ρ admits a random utility (RU) representation if there exists µ ∈ ∆(S) such that Let U be the set of all utility functions from X to R, and P be the set of all weighting functions φ : [0, 1] → [0, 1] such that φ(0) = 0 and φ(1) = 1.Every u and φ together define a rank-dependent expected utility function over the set of lotteries ∆(X) as for any p ∈ ∆(X), where we use convention that 0 t=1 p t = 0.The rank-dependent expected utility function coincides with the standard expected utility function if φ(x) = x.
Similar to the case with the expected utility function, the rank-dependent expected utility function allows us to define preference orders that are consistent with rank-dependent expected utility.
Definition 2. We say that the linear order ≻∈ S is rank-dependent expected utility linear order or ≻∈ R if there exists u ∈ U and φ ∈ P such that for any p, q ∈ ∆(X) Given the set of all rank-dependent expected utility orders we can define when observed data ρ could have been generated by a heterogeneous population of DMs with rank-dependent expected utility orders.
Definition 3 (Random Rank-Dependent Expected Utility, RRDEU).We say that ρ admits a random rank-dependent expected utility (RRDEU) representation if there exists µ ∈ ∆ (R) such that for all A ∈ A and a ∈ A.
The definition of RRDEU allows us to test whether a given data is consistent with it the same way we do it for RU.The only difference is that instead of working with all possible strict linear orders S, we need to compute the set R.

Construction of the set of rank-dependent expected utility linear orders
Before we describe the general procedure for construction of R, we explain how the procedure works with EU.

Expected Utility Model
As we mentioned before, the standard expected utility model is the special case RRDEU with φ(x) = x.Thus, to check whether a given linear order ≻ is expected utility linear order we need to check whether there exists a utility function u such that for all p, q ∈ ∆(X).Note that, in spirit of revealed preference inequalities, the latter is equivalent to requiring the existence of a set of reals {v k } K k=1 such that Since the last inequality must hold for all possible p and q, we end up having a system of linear inequalities If there are finitely many lotteries (i.e., we consider p, q ∈ Π, |Π| < ∞), then let p ≻(l) denote the l-th best lottery in Π according to ≻, then it suffices to conduct |Π| − 1 comparisons to get the following system of linear inequalities: Checking whether a finite set of linear inequalities has a solution is a linear programming problem and can be done very efficiently and fast.

Rank-dependent Expected Utility
Next we describe how to extend the procedure for the standard expected utility model to the rank-dependent one.Given a candidate linear order ≻∈ S, we need to check that there exist u and φ such that for any lotteries p and q For a finite set of lotteries, we can reformulate the problem as requiring existence of two sets The first set of inequalities just imply that the rank-dependent utilities imply the order consistent with ≻.The rest of the constrains just follow from the definition of φ (i.e., φ : [0, 1] → [0, 1], φ(0) = 0, and φ(1) = 1).Checking whether the system (1) is satisfied for some {v k } K k=1 and {f l,k } K−1, |Π| k=1, l=1 is a quadratic problem, which also can be solved efficiently and fast.
The next lemma formally establishes that the system (1) provides necessary conditions for ≻ being rank-dependent expected utility order.Lemma 1.Given Π ⊆ ∆(X), |Π| < ∞, the linear order ≻∈ S belongs to R only if there k=1, l=1 such that the system (1) is satisfied.
Proof.The result is trivially satisfied if one takes Next, we state the extension proposition that guaranties that the system (1) leads to a rank-dependent expected utility order.

Proof. The proposition requires building functions u and φ from {v
The simplest utility function that will make ≻ rank-dependent expected utility order is any peace-wise linear function with nods at points {(x k , v k )} K k=1 .To construct φ one can also take any piece-wise linear function with nods at points After the set R is constructed, the problem of testing whether a stochastic dataset ρ admits a RRDEU representation can be done by testing the restricted RU model as in McFadden Richter McFadden and Richter (1990) and KS.
Let R Π be the set of all linear orders on Π × Π that consistent with RDE (i.e., the restriction of R to Π).2 We can use system 1 to uncover the elements of R Π .We want to test whether ρ admits a RRDEU representation, this turns out to be equivalent to testing whether ρ can be generated by a population of DMs whose preferences are in R Π .Let B be the matrix of the size where k corresponds to a pair (a, A) such that a ∈ A, and ≻ l is l-th linear order from R Π .
By McFadden and Richter (1990) and KS, ρ can be explained by a population of DMs whose preferences are in R Π if and only if + .This is our main result: Theorem 1.The following are equivalent: (i) A stochastic dataset ρ admits a RRDEU representation.
(ii) A stochastic dataset ρ is such that there exists some v ∈ R The proof of Theorem 1 follows from Lemma 1, Proposition 1, and KS.
The RRDEU model is a strict generalization of REU.It is less general that RU because it predicts first order stochastic dominance (under mild monotonicity constraints) which RU does not require.Quiggin (1991) provides additional implications of RDEU.

Shape Restrictions
Our framework allows us to impose monotonicity or concavity/convexity on φ.Monotonicity is a normatively desirable property.Abdellaoui (2002) shows that convexity of φ is related to aversion.In particular, imposing it will guarantee that consumers are risk averse if the Bernoulli utility is set to the identity.
In particular, to impose the restriction that φ is weakly monotonically increasing it suffices to enhance the system (1) with the following set of linear inequality constraints: (2) Convexity (concavity) can be imposed using cyclical monotonicity (Rockafellar, 2015).In particular, for all cycles of indices {l j , k j } J j=1 such that l J = l 1 and k Proposition 2. Given a finite set of lotteries Π, the linear order ≻∈ S is rank-dependent expected utility linear order with weakly increasing and convex φ if and only if there exist k=1, l=1 such that the system (1) together with restrictions (2) and (3) is satisfied.

Econometric Testing
Here we deal with sampling variability.Sampling variability arises from the fact that ρ can be only consistently estimated by the realized choice frequencies ρ.This section follows closely Aguiar et al. (2021).First we need some additional notation.For every A ∈ A, let n A denote the number of individuals in the sample that faced choice set A, and let a i,A , i = 1, . . ., n A , be the observed choice of individual i from choice set A. Here we assume that the researcher observes a cross-section of observations for every A ∈ A. Given this we define the estimated stochastic choice rule as A natural test statistic based on Theorem 1 is where n = A n A is the sample size.
Let ρ * l , l = 1, . . ., L, be bootstrap replications of ρ.Let τ n ≥ 0 be a tuning parameter and ι be a vector of ones of dimension |R Π |. 4 To compute the critical values of T n we follow the bootstrap procedure proposed in KS: For a given confidence level α ∈ (0, 1/2), the decision rule for the test is "reject the null hypothesis if T n > ĉ1−α ", where ĉ1−α is an (1 − α)-quantile of the empirical distribution of the bootstrap statistic.

Data
To illustrate the proposed methodology we use a subsample of the dataset from Aguiar et al. (2021) to test for consistency of the behavior of a population of DMs with RRDEU and REU.Crucially, we use only one treatment (frame) of Aguiar et al. (2021) corresponding to a situation where the cost of experimental subjects to pay attention is designed to be low.In that sense, we can avoid thinking about limited attention/consideration in this paper.Aguiar et al. (2021) conducted the experiment in Amazon MTurk for a large cross-section with at most two (disjoint) choice sets per individual.In the experiment, the set of prizes is X = {0, 10, 12, 20, 30, 48, 50}.The set of lotteries Π is presented in Table 1.For example, the first lottery can be written as l 1 = (1/2, 0, 0, 0, 0, 0, 1/2) ′ (i.e. it assigns positive probability to prizes 0 and 50 only).Similarly, the second lottery can be written as l 2 = (0, 0, 1/2, 0, 0, 1/2, 0) ′ .For more details on the experiment see Aguiar et al. (2021).
Structure of the Lotteries.Here we show the special structure of our alternatives that allows us to test EU (and the independence axiom) as a restriction on the set of linear orders (i.e, we use R EU Π to denote the restriction of the set of linear orders consistent with EU to Π).The experiment was design with power against REU.Here we will use the Aguiar et al.
However, the previous restrictions are only implications of the expected utility assumption.
The necessary and sufficient conditions have been spelled out in Theorem 1.

Results
We apply the procedure described in Section 3.4 to test whether REU and RRDEU can explain the data.The results of testing are presented in Table 2.In this table, we report the values of the test statistic and the corresponding p-values coming from the bootstrap distribution (1000 bootstrap replications for every test statistic were conducted) for two models. 5We reject expected utility at the 5 percent significance level.At the same time, we cannot reject the rank-dependent expected utility model at any standard significance level.
We must highlight that the fact that RRDEU is not rejected while REU is, is not entirely surprising since RRDEU is a strict generalization of REU.However, there is no reason a priori to think that RRDEU explains the experimental datasets used here.In that sense, we add some robust nonparametric empirical evidence supporting the use of RRDEU instead of REU to explain choice over risky prospects.

Conclusions
We have proposed a new characterization of RDEU when we observe a cross-section of choices from heterogeneous DMs that choose from a finite set of lotteries and a finite collection of menus.We have established a nonparametric and computationally feasible test of RRDEU (and as a byproduct a test of REU).Our main result lends itself to statistical testing using the tools in KS.This test is wide applicable in experimental and field stochastic choice datasets.

Table 1 -
Lotteries measured in tokens, expected values, and varianceAll sessions were run between August 25, 2018 and September 17, 2018 on the MTurk platform with surveys designed in Qualtrics.The data contains choices 4099 choices from all possible nonsingleton menus that contain the default lottery o, which pays 12 tokens with certainty.

Table 2 -
Testing Results