This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Money Pumps and Bounded Rationality

Joshua Lanier, Matthew Polisson, and John K.-H. Quah Emails: jlanier84@gmail.com; matt.polisson@leicester.ac.uk; ecsqkhj@nus.edu.sg.

The standard criterion of rationality in economics is the maximization of a utility function that is stable across multiple observations of an agent’s choice behavior. In this paper, we discuss two notions of the money pump that characterize two corresponding notions of utility-maximization. We explain the senses in which the amount of money that can be pumped from a consumer is a useful measure of the consumer’s departure from utility-maximization.

JEL Codes: D11, D12.

Keywords: money pump, revealed preference, GARP, cyclical monotonicity, quasilinear utility, additive utility, constrained optimization

1 Introduction

It has often been argued that an agent’s vulnerability to money pumps is a sign of bounded or limited rationality. This paper is devoted to the study of money pumps and how they can be used to measure an agent’s adherence to rational principles.

We begin our discussion with a simple example. Suppose that there are two goods and a consumer purchases the bundle 𝐱1=(1,2)\mathbf{x}^{1}=(1,2) when prices are 𝐩1=(1,2)\mathbf{p}^{1}=(1,2) and the bundle 𝐱2=(2,1)\mathbf{x}^{2}=(2,1) when the prices are 𝐩2=(2,1)\mathbf{p}^{2}=(2,1). This situation is depicted on the left side of Figure 1 below. Note that in period 1, the bundle 𝐱2\mathbf{x}^{2} is cheaper than 𝐱1\mathbf{x}^{1}, while in period 2, 𝐱1\mathbf{x}^{1} is cheaper than 𝐱2\mathbf{x}^{2}. An arbitrageur can use this purchasing behavior to turn the consumer into a money pump. In particular, the arbitrageur may sell the consumer 𝐱1\mathbf{x}^{1} and purchase 𝐱2\mathbf{x}^{2} in period 1, which nets the arbitrageur 𝐩1(𝐱1𝐱2)=1\mathbf{p}^{1}\cdot(\mathbf{x}^{1}-\mathbf{x}^{2})=1. Then in period 2 the arbitrageur can sell the consumer 𝐱2\mathbf{x}^{2} and purchase 𝐱1\mathbf{x}^{1}, netting the arbitrageur a further 𝐩2(𝐱2𝐱1)=1\mathbf{p}^{2}\cdot(\mathbf{x}^{2}-\mathbf{x}^{1})=1. At the end of the day the consumer has been pumped for 2 dollars, while there is no net change to the arbitrageur’s stock of goods 1 and 2.

Refer to caption
(a)
Refer to caption
(b)
Figure 1: The figures depict the quantities of good 1 and good 2 purchased by a consumer in two different periods and the corresponding sets of bundles cheaper than the chosen bundle.

More generally, suppose that there are LL goods and we observe a consumer who purchases the consumption bundle 𝐱t=(x1t,x2t,,xLt)+L\mathbf{x}^{t}=(x_{1}^{t},x_{2}^{t},\ldots,x_{L}^{t})\in\mathbb{R}_{+}^{L} when prices are 𝐩t=(p1t,p2t,,pLt)++L\mathbf{p}^{t}=(p_{1}^{t},p_{2}^{t},\ldots,p_{L}^{t})\in\mathbb{R}_{++}^{L}, at some observation t{1,2,,T}t\in\{1,2,\ldots,T\}. The dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} admits a money pump if there are observations t1,t2,,tKt_{1},\,t_{2},\ldots,\,t_{K} with t1=tKt_{1}=t_{K} such that an arbitrageur who purchases 𝐱tk+1\mathbf{x}^{t_{k+1}} in period tkt_{k} while simultaneously selling 𝐱tk\mathbf{x}^{t_{k}} to the consumer will make a strictly positive amount of money; formally,

MPt1,t2,,tKk=1K1𝐩tk(𝐱tk𝐱tk+1)>0.\text{MP}_{t_{1},t_{2},\ldots,t_{K}}\coloneqq\sum_{k=1}^{K-1}\mathbf{p}^{t_{k}}\cdot(\mathbf{x}^{t_{k}}-\mathbf{x}^{t_{k+1}})>0. (1)

There is another way of understanding the money pump which turns out to be crucial to the formal results in the paper. Notice that if MPt1,t2,,tK>0\text{MP}_{t_{1},t_{2},\ldots,t_{K}}>0 then

𝐩t1𝐱t1+𝐩t2𝐱t2++𝐩tK1𝐱tK1>𝐩t1𝐱t2+𝐩t2𝐱t3++𝐩tK2𝐱tK1+𝐩tK1𝐱t1\mathbf{p}^{t_{1}}\cdot\mathbf{x}^{t_{1}}+\mathbf{p}^{t_{2}}\cdot\mathbf{x}^{t_{2}}+\ldots+\mathbf{p}^{t_{K-1}}\cdot\mathbf{x}^{t_{K-1}}>\mathbf{p}^{t_{1}}\cdot\mathbf{x}^{t_{2}}+\mathbf{p}^{t_{2}}\cdot\mathbf{x}^{t_{3}}+\ldots+\mathbf{p}^{t_{K-2}}\cdot\mathbf{x}^{t_{K-1}}+\mathbf{p}^{t_{K-1}}\cdot\mathbf{x}^{t_{1}}

where we have used the requirement that t1=tKt_{1}=t_{K}. Instead of buying 𝐱t1\mathbf{x}^{t_{1}} at t1t_{1}, and 𝐱t2\mathbf{x}^{t_{2}} at t2t_{2} and so forth, the consumer could have purchased 𝐱t2\mathbf{x}^{t_{2}} at t1t_{1}, 𝐱t3\mathbf{x}^{t_{3}} at t2t_{2}, and so forth; by altering the timing of purchases in this way (interpreting the index tt as time), the consumer could have obtained the same set of bundles {𝐱t1,𝐱t2,,𝐱tK1}\{\mathbf{x}^{t_{1}},\mathbf{x}^{t_{2}},\ldots,\mathbf{x}^{t_{K-1}}\} and saved money. In this sense, the consumer’s purchasing behavior is irrational and the presence of a money pump is equivalent to the presence of expenditure decisions which, taken as a whole across all observations, are cost inefficient.

But how is the presence or absence of a money pump related to the other standard by which economists judge rationality, namely, utility-maximization? Indeed, the absence of a money pump is also known as cyclical monotonicity and it is known that a dataset DD is cyclically monotone (i.e., free of money pumps) if and only if there is a quasilinear rationalization of DD, i.e., there is a well-behaved (in the sense of being continuous, strictly increasing, and concave) utility function U:+LU:\mathbb{R}^{L}_{+}\to\mathbb{R} such that 𝐱t\mathbf{x}^{t} maximizes U(𝐱)𝐩t𝐱U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}, at all tTt\leqslant T (see Brown and Calsamiglia (2007)). Alternatively, cyclical monotonicity is also equivalent to the additive rationalization of DD, by which we mean that there is a well-behaved utility function UU such that

t=1TU(𝐱t)t=1TU(𝐱~t)\sum_{t=1}^{T}U(\mathbf{x}^{t})\geqslant\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t})

for all (𝐱~1,𝐱~2,,𝐱~T)+LT(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T})\in\mathbb{R}^{LT}_{+} with t=1T𝐩t𝐱~tt=1T𝐩t𝐱t\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}\leqslant\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t} (see Browning (1989)). In other words, the consumer’s choices (𝐱t)t=1T(\mathbf{x}^{t})_{t=1}^{T} can be understood as maximizing an overall utility function V:+LTV:\mathbb{R}^{LT}_{+}\to\mathbb{R} that is additive across bundles at each observation, i.e.,

V(𝐱~1,𝐱~2,,𝐱~T)=t=1TU(𝐱t),V(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T})=\sum_{t=1}^{T}U(\mathbf{x}^{t}),

subject to the overall expenditure not exceeding t=1T𝐩t𝐱t\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}.111Notice that in quasilinear rationalization, as opposed to additive rationalization, the consumer is not subject to a budget; she can, in principle, spend as much as she likes, but expenditure is restrained because it incurs dis-utility. It is particularly clear that a dataset that has an additive rationalization must be free of money pumps: the consumer cannot be maximizing a function like VV if a reshuffling of purchases leads to savings, since this frees up money that could be used to buy more goods in one or more periods and thus increase VV.

These characterizations of cyclical monotonicity (recall that cyclical monotonicity is equivalent to the absence of a money pump) lead naturally to the following question. For a given dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} collected from a consumer, we could work out the optimal trading strategy of the arbitrageur (the strategy which nets the most money) and consequently we could work out the amount of money which would be extracted from the consumer by an arbitrageur following this optimal strategy. We use TMP (for total money pump) to denote this amount of money. It seems sensible to regard TMP as a measure of the consumer’s departure from rationality, but in what sense does the TMP actually capture irrational behavior? In particular, can TMP be understood as a measure of the degree to which behavior departs from either quasilinear or additive utility maximization?

A natural approach to measuring deviations from quasilinear rationalization was proposed by Allen and Rehbeck (2021).222Our comments here refer to their generalized approach as discussed in their Appendix B. Notice that a well-behaved utility function UU is a quasilinear rationalization of DD if and only if

max𝐱+L(U(𝐱)𝐩t𝐱)(U(𝐱t)𝐩t𝐱t)=0 for all tT.\max_{\mathbf{x}\in\mathbb{R}^{L}_{+}}\Big{(}U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\Big{)}-\Big{(}U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\Big{)}=0\>\mbox{ for all $t\leqslant T$.}

When DD admits a money pump, no such UU exists and thus, for every well-behaved utility function UU,

max𝐱+L(U(𝐱)𝐩t𝐱)(U(𝐱t)𝐩t𝐱t)0 for all tT.\max_{\mathbf{x}\in\mathbb{R}^{L}_{+}}\Big{(}U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\Big{)}-\Big{(}U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\Big{)}\geqslant 0\>\mbox{ for all $t\leqslant T$.}

with the inequality being strict for at least one observation tt. It follows that a natural measure of the consumer’s departure from quasilinear rationalization is

QinfU{t=1T[max𝐱+L(U(𝐱)𝐩t𝐱)(U(𝐱t)𝐩t𝐱t)]}Q\coloneqq\inf_{U}\left\{\sum_{t=1}^{T}\left[\max_{\mathbf{x}\in\mathbb{R}^{L}_{+}}\Big{(}U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\Big{)}-\Big{(}U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\Big{)}\right]\right\}

where the infimum is taken over all well-behaved utility functions. QQ is a measure of inefficiency in the form of lost utility (summed across all TT periods).

In the case of additive rationalization, we can measure the severity of departures from this property using the cost efficiency approach advocated by Afriat (1973). Firstly, we observe that a dataset DD cannot be additively rationalized if and only if the consumer is cost inefficient in the following sense: for any well-behaved utility function UU, the required expenditure to hit the utility target t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{t}) is strictly lower than the amount actually spent; formally,

eUmin{t=1T𝐩t𝐱~t:t=1TU(𝐱~t)t=1TU(𝐱t)}<t=1T𝐩t𝐱t.e_{U}\coloneqq\min\left\{\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}:\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t})\geqslant\sum_{t=1}^{T}U(\mathbf{x}^{t})\right\}<\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}.

We can then measure the level of cost inefficiency by

A=infU{t=1T𝐩t𝐱teU},A=\inf_{U}\left\{\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e_{U}\right\},

where the infimum is taken over all well-behaved utility functions.

The first main result of the paper says that these three ways of measuring rationality coincide; i.e., Q=A=TMPQ=A=\mbox{TMP}.

The second part of the paper begins with the observation that the existence of a money pump is not always a compelling sign of limited rationality. Suppose a consumer purchases the bundle 𝐱1=(1,1)\mathbf{x}^{1}=(1,1) when prices are 𝐩1=(1,1)\mathbf{p}^{1}=(1,1) and purchases 𝐱2=(2,2)\mathbf{x}^{2}=(2,2) when prices are 𝐩2=(2,2)\mathbf{p}^{2}=(2,2). This situation is depicted in Figure 1(b). This behavior clearly leads to a money pump. Specifically, the arbitrageur can, in period 1, buy bundle 𝐱2\mathbf{x}^{2} and sell 𝐱1\mathbf{x}^{1} netting 𝐩1(𝐱1𝐱2)=2\mathbf{p}^{1}\cdot(\mathbf{x}^{1}-\mathbf{x}^{2})=-2. Then, in period 2, the arbitrageur can buy bundle 𝐱1\mathbf{x}^{1} and sell 𝐱2\mathbf{x}^{2} to make 𝐩2(𝐱2𝐱1)=4\mathbf{p}^{2}\cdot(\mathbf{x}^{2}-\mathbf{x}^{1})=4. So the arbitrageur has extracted 2 dollars from the consumer. However, such behavior by a consumer may not be that irrational: for example, goods 1 and 2 could be festive goods which are consumed in greater quantities in the festive season (period 2), notwithstanding the higher prices. Put another way, the data has no additive rationalization because the consumer may not be maximizing an additive utility function that is symmetric across the two periods when observations are taken.

Notice also that there is a difference between the two examples depicted in Figure 1. The example depicted in Figure 1(b) clearly admits a rationalization, in the sense that there is a well-behaved utility function U:+LU:\mathbb{R}^{L}_{+}\to\mathbb{R} such that U(𝐱t)U(𝐱)U(\mathbf{x}^{t})\geqslant U(\mathbf{x}) for all bundles which are cheaper than 𝐱t\mathbf{x}^{t} at price 𝐩t\mathbf{p}^{t}, i.e., for all 𝐱\mathbf{x} such that 𝐩t𝐱𝐩t𝐱t\mathbf{p}^{t}\cdot\mathbf{x}\leqslant\mathbf{p}^{t}\cdot\mathbf{x}^{t}. On the other hand, this is plainly not the case with the example depicted in Figure 1(a). We know from Afriat’s Theorem (see Afriat (1967), Diewert (1973), and Varian (1982)) that a dataset DD admits a rationalization if and only if obeys a property called the generalized axiom of revealed preference (GARP). The latter property says that the dataset does not admit a money pump (as we have defined it), with the added requirement that the arbitrageur makes money at every round of the exchange. We call a money pump with this added property a constrained money pumps. While a money pump exists in the second example depicted in Figure 1(b), it is not a constrained money pump, because the arbitrageur makes money in one round and loses in another; indeed, GARP holds because a constrained money pump is not possible and (by Afriat’s Theorem) a rationalization exists. On the other hand, in the example depicted in Figure 1(a), the money pump is a constrained money pump and thus that example violates GARP and has no rationalization.

These observations suggest that we could use the amount of money extracted from constrained money pumps as a measure of rationality; this is (in essence) the approach proposed by Echenique, Lee, and Shum (2011) and Smeulders, Cherchye, Spieksma, and De Rock (2013) in their studies of rationality and constrained money pumps.333There is a significant literature on the measurement of deviations from rationality. Afriat (1973) proposed to measure deviations in terms of the proportion of one’s budget wasted in each period and then aggregating across periods by taking the maximum waste; he refers to his proposed measure as the critical cost efficiency index. Varian (1990) generalizes Afriat’s approach by proposing other ways of aggregating waste across periods. Houtman and Maks (1985) suggest measuring violations in terms of the number of observations which need to be dropped before the remaining dataset becomes rationalizable. Apesteguia and Ballester (2015) propose measuring violations by taking the Lebesgue measure of the affordable strict upper contour set (the set preferred to the bundle actually chosen) in each period and adding up these measures across observations. (We are referring to the approach discussed in Appendix D.3; their main paper deals with a discrete choice environment.) Dean and Martin (2016) propose assigning a cost for breaking each revealed preference relation and then calculating the cheapest way of breaking every revealed preference cycle (i.e. every violation of GARP). Halevy, Persitz, and Zrill (2018) show how measures of departures from rationality can be used to perform parametric estimation of utility functions. The second main result of our paper provides a foundation for this approach.444While our index as well as those of Echenique et al. (2011) and Smeulders et al. (2013) are based on the notion of a money pump there is actually an important distinction between our different measures. See Section 3.3 for details.

Given a dataset DD, let TMPc\text{TMP}_{c} be the the amount of money which would be extracted from the consumer by an arbitrageur who was following his optimal trading strategy under the provision that he cannot lose money in any round of trading. It follows immediately from the definition that TMPcTMP\text{TMP}_{c}\leqslant\text{TMP} and TMPc=0\text{TMP}_{c}=0 if the consumer purchasing behavior satisfies GARP. We show that TMPc\text{TMP}_{c} coincides with appropriately modified versions of the additive cost and quasilinear utility inefficiency indices. To explain further, let eUce_{U}^{c} denote the smallest amount of money the consumer could pay (summed across TT periods) to hit the utility target t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{t}), provided that in each period tt the consumer cannot spend more than 𝐩t𝐱t\mathbf{p}^{t}\cdot\mathbf{x}^{t}. Clearly, the additional constraint guarantees that eUceUe_{U}^{c}\geqslant e_{U}. Analogous to the case of AA, we could use Ac=infU𝐩t𝐱teUcA_{c}=\inf_{U}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e_{U}^{c} (where the infimum is taken over all well-behaved utility functions) as a measure of constrained additive cost inefficiency. Lastly, we can define QcQ_{c} in a way similar to our definition of QQ, with the difference being that the suprema are taken over all bundles 𝐱\mathbf{x} such that 𝐩t𝐱t𝐩t𝐱\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x} instead of over all 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L}. Like QQ, the index QcQ_{c} is a measure how much more utility (net of expenditure) that a consumer with utility function UU can obtain by deviating from (𝐱t)tT(\mathbf{x}^{t})_{t\leqslant T}, but with an additional constraint on expenditure in each period. Obviously, QcQQ_{c}\leqslant Q. Our second main result states that TMPc=Ac=Qc\text{TMP}_{c}=A_{c}=Q_{c}. Additionally, we show that these measures can be calculated by solving a simple linear program.

Outline of the paper.  The remainder of the paper is organized as follows. Section 2 introduces the total money pump index TMP and presents our main theorem (Theorem 2) for TMP. Section 3 introduces the constrained total money pump index TMPc\text{TMP}_{c} and presents our main theorem for TMPc\text{TMP}_{c} (Theorem 4). This section also has a comparison between our measure TMPc\text{TMP}_{c} and the money pump indices introduced in Echenique et al. (2011) and Smeulders et al. (2013). Section 4 concludes. The appendix gives a more careful explanation of the relationship between our measure of additive cost inefficiency and the critical cost efficiency index introduced in Afriat (1973), as well as all proofs omitted from the body of the paper.

2 The Money Pump

We assume that we observe the consumer’s purchases of LL goods. A consumption bundle is denoted 𝐱=(x1,x2,,xL)+L\mathbf{x}=(x_{1},x_{2},\ldots,x_{L})\in\mathbb{R}_{+}^{L} where xx_{\ell} is the quantity of good \ell consumed. A price vector is denoted 𝐩=(p1,p2,,pL)++L\mathbf{p}=(p_{1},p_{2},\ldots,p_{L})\in\mathbb{R}_{++}^{L} where pp_{\ell} is the price of good \ell. A dataset is a finite collection of consumption bundle / price pairs denoted D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} where intuitively (𝐩t,𝐱t)(\mathbf{p}^{t},\mathbf{x}^{t}) means that the consumer purchased 𝐱t\mathbf{x}^{t} when prices were 𝐩t\mathbf{p}^{t}. A well-behaved utility function is a mapping U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} which is continuous, increasing, and concave.555A function U:XU:X\rightarrow\mathbb{R} is increasing if 𝐱𝐱\mathbf{x}\geqslant\mathbf{x}^{\prime} implies U(𝐱)U(𝐱)U(\mathbf{x})\geqslant U(\mathbf{x}^{\prime}) and 𝐱>𝐱\mathbf{x}>\mathbf{x}^{\prime} implies U(𝐱)>U(𝐱)U(\mathbf{x})>U(\mathbf{x}^{\prime}).

A dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} is rationalized by a utility function U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} if
U(𝐱t)(>)U(𝐱)U(\mathbf{x}^{t})\geqslant(>)\ U(\mathbf{x}) for all tt and all 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} satisfying 𝐩t𝐱t(>)𝐩t𝐱\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant(>)\ \mathbf{p}^{t}\cdot\mathbf{x}.666What we mean by this is that U(𝐱t)U(𝐱)U(\mathbf{x}^{t})\geqslant U(\mathbf{x}) for all tt and all 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} satisfying 𝐩t𝐱t𝐩t𝐱\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}, and the former inequality is strict if the latter inequality is strict. The dataset DD is additively rationalized by a utility function U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} if

t=1TU(𝐱t)(>)t=1TU(𝐱~t),(𝐱~1,𝐱~2,,𝐱~T)+LT s.t. t=1T𝐩t𝐱t(>)t=1T𝐩t𝐱~t\sum_{t=1}^{T}U(\mathbf{x}^{t})\geqslant(>)\ \sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t}),\qquad\forall(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T})\in\mathbb{R}_{+}^{LT}\text{ s.t. }\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant(>)\ \sum_{t=1}^{T}\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}

An additive rationalization requires that the consumer’s choices yield a higher additive (across-period) utility than any other affordable sequence of bundles (𝐱~1,𝐱~2,,𝐱~T)(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T}). Note that if UU additively rationalizes the data then, for each tt, the choice 𝐱t\mathbf{x}^{t} must yield more utility than any other bundle which costs less (i.e. any bundle 𝐱\mathbf{x} satisfying 𝐩t𝐱t𝐩t𝐱\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}). Thus, if UU additively rationalizes the data then UU rationalizes the data as well. Recall, however, the second example in the Introduction which shows that the converse does not hold. The dataset DD is quasilinear rationalized by a utility function U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} if, for all tt,

U(𝐱t)𝐩t𝐱tU(𝐱)𝐩t𝐱,𝐱+LU(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\ U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x},\qquad\qquad\forall\mathbf{x}\in\mathbb{R}_{+}^{L}

A quasilinear utility maximizer seeks to maximize utility net of expenditure. Note that in the case of quasilinear rationalization, the consumer is not constrained by a budget set, but expenditure leads to dis-utilty and has the effect of restraining purchases.

2.1 Money Pump and Cyclical Monotonicity

A dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} contains a money pump if there are observations t1,t2,,tKt_{1},\,t_{2},\ldots,\,t_{K} (drawn from DD) such that t1=tKt_{1}=t_{K} and MPt1,t2,,tK\text{MP}_{t_{1},t_{2},\ldots,t_{K}} as defined by (1) is strictly positive. A dataset DD that is free of money pumps is said to satisfy cyclical monotonicity. Another way of saying the same thing is that a money pump exists if there is a permutation of {1,2,,T}\{1,2,\ldots,T\}, denoted σ\sigma, where, in period tt, the arbitrageur sells 𝐱t\mathbf{x}^{t} and buys 𝐱σ(t)\mathbf{x}^{\sigma(t)}; and the arbitrageur pumps a strictly positive amount of money,

MPσ=t=1T𝐩t(𝐱t𝐱σ(t))\text{MP}_{\sigma}=\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})

from the consumer. We define the total money pump (TMP) as the amount of money which would be extracted from the consumer by an arbitrageur following an optimal trading strategy. That is,

TMP=supσt=1T𝐩t(𝐱t𝐱σ(t))\text{TMP}=\sup_{\sigma}\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)}) (2)

where the supremum is taken over all permutations σ\sigma.

It is not hard to show that if DD is quasilinear rationalized by UU then DD is also additively rationalized by UU; on the other hand, there is no guarantee that if DD is additively rationalized by UU, then the same UU provides a quasilinear rationalization of DD. The following result shows, among other things, that in fact these two types of rationalizations are empirically equivalent, and holds whenever TMP=0\text{TMP}=0.

Theorem 1.

Let D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} be a dataset. The following are equivalent.

  1. 1.

    TMP=0\text{{\em TMP}}=0.

  2. 2.

    The dataset DD satisfies cyclical monotonicity.

  3. 3.

    The dataset DD can be additively rationalized by a utility function UU.

  4. 4.

    The dataset DD can be additively rationalized by a well-behaved utility function UU.

  5. 5.

    The dataset DD can be quasilinear rationalized by a utility function UU.

  6. 6.

    The dataset DD can be quasilinear rationalized by a well-behaved utility function UU.

The claims in Theorem 1 are not new in the sense that they can easily be pieced together using existing results. In particular, the equivalence between statements 1 and 2 is obvious. The equivalence between statements 2, 3, and 4 is found in Browning (1989) and the equivalence between statements 2, 5, and 6 is found in Brown and Calsamiglia (2007). To keep this article reasonably self-contained, we provide a proof of Theorem 1 in the Appendix.

The equivalence between statements 3 and 4 and the equivalence between items 5 and 6 shows that there are no additional restrictions placed on the data by assuming that UU is well-behaved in either the additive rationalization or the quasilinear rationalization.

The equivalence between 1, 4, and 6 shows that there is a tight relationship between the existence of a money pump and additive and quasilinear rationalizations. This suggests that the value of the total money pump may be useful as a measure of the degree to which the consumer fails to act as an additive or quasilinear utility maximizer. We address this issue in the next subsection.

2.2 TMP as a measure of rationality

By defnition, a dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} can be additively rationalized if the observations, when taken as a whole, maximize an overall utility function V:+LTV:\mathbb{R}^{LT}_{+}\to\mathbb{R} that is additive across bundles at each observations, i.e., V(𝐱~1,𝐱~2,,𝐱~T)=t=1TU(𝐱~t)V(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T})=\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t}), subject to the overall expenditure not exceeding the consumer’s total expenditure, which is t=1T𝐩t𝐱t\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}. When DD cannot be additively rationalized, how should we measure the extent of the violation? The cost-efficiency approach proposed by Afriat (1973) measures the amount of money which could have been saved by the consumer were they to have acted perfectly in line with the utility maximization hypothesis under investigation (the additive utility model in our case).777Appendix A discusses in greater detail the relationship between AA and Afriat’s critical cost efficiency index. For a utility function UU let eUe^{U} denote the smallest amount of money for which a consumer with additive (across periods) utility function UU could obtain utility t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{t}). That is,

eU=inf{t=1T𝐩t𝐱~t:t=1TU(𝐱~t)t=1TU(𝐱t)}e^{U}=\inf\left\{\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}:\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t})\geqslant\sum_{t=1}^{T}U(\mathbf{x}^{t})\right\}

The additive cost inefficiency displayed by the consumer is the difference between the amount that the consumer actually spent and the smallest amount of money they could have spent to achieve the same utility. More formally, the additive cost inefficiency is the number

A=infU(t=1T𝐩t𝐱teU)A=\inf_{U}\left(\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e^{U}\right) (3)

where the infimum is taken over all utility functions.

Next, let us suppose that we would like to measure the extent to which the consumer has failed to act as a quasilinear utility maximizer. One approach, which might be termed the utility efficiency approach, is to measure the additional utility which the consumer could have derived had they acted perfectly in line with the model of utility maximization under investigation. Of course, this approach only makes sense when utility is cardinal (in particular, the utility function must be identified up to translation by the consumer’s behavior). If the utility function is only identified up to monotonic transformation then it makes no sense to talk about differences in utility. As the quasilinear utility function is indeed cardinal in the requisite sense, it is reasonable to define the quasilinear utility inefficiency displayed by the consumer as

Q=infU(t=1Tsup𝐱+L[U(𝐱)𝐩t𝐱][U(𝐱t)𝐩t𝐱t])Q=\inf_{U}\left(\sum_{t=1}^{T}\sup_{\mathbf{x}\in\mathbb{R}_{+}^{L}}\left[U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\right]-\left[U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\right]\right) (4)

The term in the supremum represents the largest amount of quasilinear utility which could have been attained by the consumer in period tt whereas the rightmost term represents the amount of quasilinear utility actually achieved. The object QQ was introduced in Allen and Rehbeck (2021) as a measure of deviation from quasilinear utility maximization.888What we call QQ corresponds to the “minimum deviations” considered in Appendix B of Allen and Rehbeck (2021) when using (in their language) the aggregator f(e1,e2,,eT)=t=1Tetf(e_{1},e_{2},\ldots,e_{T})=\sum_{t=1}^{T}e_{t}.

Importantly, Allen and Rehbeck (2021) show that QQ is easy to calculate. In particular, QQ is equal to ε¯\bar{\varepsilon}, the solution value for the linear programming problem of finding (u1,u2,,uT)T(u_{1},u_{2},\ldots,u_{T})\in\mathbb{R}^{T} and (ε1,ε2,,εT)+T(\varepsilon_{1},\varepsilon_{2},\ldots,\varepsilon_{T})\in\mathbb{R}_{+}^{T} to solve {IEEEeqnarray}rCl min&   ∑_t=1^T ε_t
s.t.   u_s ⩽u_t + p^t ⋅( x^s - x^t ) + ε_t,    for all s,t

To recap, we have introduced three distinct ways of quantifying deviations from cyclical monotonicity. It turns out that they are all the same.

Theorem 2.

For any dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T},

TMP=A=Q=ε¯.\text{{\em TMP}}=A=Q=\bar{\varepsilon}. (5)

Moreover, there exists a well-behaved utility function U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} that attains the infimum in the definitions of AA and QQ.

As noted above, the result Q=ε¯Q=\bar{\varepsilon} is shown in Allen and Rehbeck (2021). We include it here and provide a proof for the sake of completeness.

To give some insight into the proof of Theorem 2 let us focus on how we show that TMP=Q\text{TMP}=Q (the idea behind showing that TMP=A\text{TMP}=A is similar). The “easy direction” is showing that QTMPQ\geqslant\text{TMP}. Indeed, for any UU and permutation σ\sigma we have {IEEEeqnarray*}rCl ∑_t=1^T sup_xR_+^L [ U(x) - p^t ⋅x] - [ U(x^t) - p^t ⋅x^t ] & ⩾ ∑_t=1^T [ U( x^σ(t) ) - p^t ⋅x^σ(t) ] - [ U(x^t) - p^t ⋅x^t ]
= ∑_t=1^T p^t ⋅( x^t - x^σ(t) ) and so the amount of quasilinear utility wasted for any UU is always greater than the amount of money which can be pumped for any σ\sigma. Thus, QTMPQ\geqslant\text{TMP}.

Showing that TMPQ\text{TMP}\geqslant Q is more delicate. The key insight we utilize is that for any permutation σ\sigma which achieves the supremum in the definition of TMP it happens that the permuted dataset Dσ=(𝐩t,𝐱σ(t))tTD_{\sigma}=(\mathbf{p}^{t},\mathbf{x}^{\sigma(t)})_{t\leqslant T} satisfies cyclical monotonicity. In other words, the purchasing behavior of the arbitrageur, which is given by DσD_{\sigma}, must satisfy cyclical monotonicity. Once this fact is established Theorem 1 can be applied to show that there exists a well-behaved utility function UU which rationalizes the permuted data. It can then be shown that the amount of money pumped via σ\sigma is weakly greater than the amount of quasilinear utility wasted according to UU which establishes that TMPQ\text{TMP}\geqslant Q.

Recall that from items 3-6 of Theorem 1 we learned that when dealing with additive or quasilinear rationalizations there are no additional restrictions imposed on the data by requiring that the rationalizing utility function is well-behaved. This insight is preserved in Theorem 2 in the sense that the infima in the definitions of AA and QQ can always be achieved by well-behaved utility functions and thus we could have defined AA and QQ using infima over the collection of well-behaved utility functions without changing the content of these objects.

3 The Constrained Money Pump

3.1 GARP and the constrained money pump

A dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} satisfies the generalized axiom of revealed preferences (GARP) if, for all t1,t2,,tKt_{1},t_{2},\ldots,t_{K} with t1=tKt_{1}=t_{K} satisfying

𝐩tk𝐱tk𝐩tk𝐱tk+1, for all k{1,2,,K1}\mathbf{p}^{t_{k}}\cdot\mathbf{x}^{t_{k}}\geqslant\mathbf{p}^{t_{k}}\cdot\mathbf{x}^{t_{k+1}},\qquad\qquad\text{ for all }k\in\{1,2,\ldots,K-1\} (6)

it is not the case that any of the inequalities in (6) hold strictly. We know from Afriat (1967) that GARP is a necessary and sufficient condition for a dataset to be rationalized by a well-behaved utility function.

A permutation of {1,2,,T}\{1,2,\ldots,T\}, denoted σ\sigma, is constrained for DD if 𝐩t𝐱t𝐩t𝐱σ(t)\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)} for all tt. A constrained permutation σ\sigma represents a trading strategy (sell 𝐱t\mathbf{x}^{t} and buy 𝐱σ(t)\mathbf{x}^{\sigma(t)} in each period tt) which nets the arbitrageur a weakly positive sum in each period. The constrained total money pump index, denoted TMPc\text{TMP}_{c}, is defined as in (2), but with the supremum taken over all constrained permutations. In other words, TMPc\text{TMP}_{c} is the amount of money which would be extracted from the consumer by an arbitrageur who was following his optimal trading strategy under the provision that he cannot lose money in any round of trading.

From Theorem 1 we know that a consumer who satisfies GARP can be turned into a money pump provided they fail to satisfy the stronger property of cyclical monotonicity. It is however plain from the definitions that the consumer who satisfies GARP cannot be turned into a constrained money pump. We next present two models of behavior which turn out to be characterized by GARP.

The dataset DD is constrained additively rationalized by U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} if

t=1TU(𝐱t)t=1TU(𝐱~t),(𝐱~1,𝐱~2,,𝐱~T)+LT s.t. 𝐩t𝐱t𝐩t𝐱~t,t\sum_{t=1}^{T}U(\mathbf{x}^{t})\geqslant\ \sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t}),\qquad\forall(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T})\in\mathbb{R}_{+}^{LT}\ \text{ s.t. }\ \mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t},\ \forall t

where the leftmost inequality is required to be strict if any of the inequalities on the right hand side hold strictly. The constrained additive rationalization requires the consumer to maximize additive utility subject to period specific budget sets. In particular, the consumer is not allowed to reduce spending in one period in order to increasing spending in a different period. Due to this credit constraint it is easy to see that a dataset is rationalized by some utility function UU if and only if the dataset is constrained additively rationalized.

The dataset DD is constrained quasilinear rationalized by U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} if

U(𝐱t)𝐩t𝐱tU(𝐱)𝐩t𝐱,𝐱+L s.t. 𝐩t𝐱t𝐩t𝐱U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x},\qquad\qquad\forall\mathbf{x}\in\mathbb{R}_{+}^{L}\text{ s.t. }\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}

In a constrained quasilinear rationalization, the observed choice 𝐱t\mathbf{x}^{t} need only be superior (net of expenditure) to bundles which are cheaper than itself. Unlike an (unconstrained) quasilinear rationalization, it is not required that the net utility of 𝐱t\mathbf{x}^{t} is higher than that of all alternative bundles.

The following result relates the concepts just introduced.

Theorem 3.

Let D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} be a dataset. The following are equivalent.

  1. 1.

    TMPc=0\text{{\em TMP}}_{c}=0.

  2. 2.

    The dataset DD satisfies GARP.

  3. 3.

    The dataset DD can be rationalized by a utility function UU.

  4. 4.

    The dataset DD can be rationalized by a well-behaved utility function UU.

  5. 5.

    The dataset DD can be constrained additively rationalized by a well-behaved UU.

  6. 6.

    The dataset DD can be constrained quasilinear rationalized by an increasing and continuous UU.

It is easy to check that items 1 and 2 are equivalent. It is also easy to see that a utility function UU rationalizes DD if and only if UU constrained additively rationalizes DD and thus items 4 and 5 are equivalent. The equivalence between items 2, 3, and 4 is well-known and is part of Afriat’s Theorem. Thus, the only novel part of Theorem 3 is the equivalences involving item 6. Note that we do not guarantee that the constrained quasilinear utility function is well-behaved (however, it is increasing and continuous).

Theorem 3 suggests that TMPc\text{TMP}_{c} can be used to measure the extent to which any of the equivalent conditions in the theorem are violated. This is the theme of the next subsection.

3.2 TMPc\text{TMP}_{c} as a measure of rationality

Here we introduce constrained versions of the additive cost inefficiency and quasilinear utility inefficiency measures introduced in Section 2. Because Theorem 3 establishes that constrained additive and constrained quasilinear utility maximization are equivalent to GARP these measures can be thought of as reporting the extent to which GARP is violated.

To proceed, let D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} be a dataset. For a utility function UU let ecUe_{c}^{U} denote the smallest amount of money which a consumer with additive (across periods) utility function UU would need in order to obtain the utility level t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{t}), while not spending more than 𝐩t𝐱t\mathbf{p}^{t}\cdot\mathbf{x}^{t} in each period tt, i.e.,

ecU=inf{t=1T𝐩t𝐱~t:t=1TU(𝐱~t)t=1TU(𝐱t) and 𝐩t𝐱t𝐩t𝐱~t,t}e_{c}^{U}=\inf\left\{\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}:\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t})\geqslant\sum_{t=1}^{T}U(\mathbf{x}^{t})\text{ and }\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t},\ \forall t\right\}

The constrained additive cost inefficiency displayed by the consumer is the amount of money the consumer could save while still obtaining the same additive utility provided that in each period spending is kept within the original budget set. More precisely, the constrained additive cost inefficiency is

Ac=infU(t=1T𝐩t𝐱tecU)A_{c}=\inf_{U}\left(\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e_{c}^{U}\right) (7)

where the infimum is taken over all utility functions. The interpretation of AcA_{c} is the same as with AA and, in particular, it could be thought of a measure of deviation from the model of constrained additive utility maximization via the cost efficiency approach.

For a price vector 𝐩++L\mathbf{p}\in\mathbb{R}_{++}^{L} and a number m>0m>0 let B(𝐩,m)B(\mathbf{p},m) denote the linear budget set B(𝐩,m)={𝐱+L:m𝐩𝐱}B(\mathbf{p},m)=\{\mathbf{x}\in\mathbb{R}_{+}^{L}:m\geqslant\mathbf{p}\cdot\mathbf{x}\}. The constrained quasilinear utility inefficiency displayed by the consumer is the amount of extra quasilinear utility the consumer could have acquired by deviating from 𝐱t\mathbf{x}^{t}, provided that in each period the consumer’s expenditure does not exceed 𝐩t𝐱t\mathbf{p}^{t}\cdot\mathbf{x}^{t}. Formally, the constrained quasilinear utility inefficiency is

Qc=infU(t=1Tsup𝐱B(𝐩t,𝐩t𝐱t)[U(𝐱)𝐩t𝐱][U(𝐱t)𝐩t𝐱t])Q_{c}=\inf_{U}\left(\sum_{t=1}^{T}\sup_{\mathbf{x}\in B(\mathbf{p}^{t},\mathbf{p}^{t}\cdot\mathbf{x}^{t})}\left[U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\right]-\left[U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\right]\right) (8)

where the infimum is taken over all utility functions. The interpretation of QcQ_{c} is the same as with QQ. We know that QQ can be calculated by solving a linear programming problem and it is natural to conjecture that QcQ_{c} can also be calculated in this fashion. Indeed, this happens to be the case. QcQ_{c} coincides with ε¯c\bar{\varepsilon}_{c}, the value of the linear programming problem of finding (u1,u2,,uT)T(u_{1},u_{2},\ldots,u_{T})\in\mathbb{R}^{T} and (ε1,ε2,,εT)+T(\varepsilon_{1},\varepsilon_{2},\ldots,\varepsilon_{T})\in\mathbb{R}_{+}^{T} to solve {IEEEeqnarray}rCl min&   ∑_t=1^T ε_t
s.t.   u_s ⩽u_t + p^t ⋅( x^s - x^t ) + ε_t,   ∀s,t   such that  p^t ⋅x^t ⩾p^t ⋅x^s Note that the linear programs of (2.2) and (8) are almost identical. The difference is that the constraints in (8) only apply for pairs of observations t,st,s where 𝐩t𝐱t𝐩t𝐱s\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{s} whereas the constraints in (2.2) apply regardless of whether this condition holds or not.

The following result shows that all the measures of deviation from GARP just introduced are equivalent.

Theorem 4.

For any dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T},

TMPc=Ac=Qc=ε¯c.\text{{\em TMP}}_{c}=A_{c}=Q_{c}=\bar{\varepsilon}_{c}. (9)

Moreover, there exists a continuous and increasing utility function U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} that attains the infimum in the definitions of AcA_{c} and QcQ_{c}.

The proof of Theorem 4 shares much in common with the proof of Theorem 2 (with a couple of added nuances). To explain further we focus on the proof that TMPc=Qc\text{TMP}_{c}=Q_{c} (the proof that TMPc=Ac\text{TMP}_{c}=A_{c} is similar). The “easy direction” is showing that QcTMPcQ_{c}\geqslant\text{TMP}_{c} and the proof approach is essentially the same as the one we used to show QTMPQ\geqslant\text{TMP} in Theorem 2.

To show that TMPcQc\text{TMP}_{c}\geqslant Q_{c} we proceed as follows. Let σ\sigma be a constrained permutation which achieves the supremum in the definition of TMPc\text{TMP}_{c}. The first step of our proof is to show that the permuted dataset Dσ=(𝐩t,𝐱σ(t))D_{\sigma}=(\mathbf{p}^{t},\mathbf{x}^{\sigma(t)}) cannot be pumped by any permutation σ\sigma^{\prime} which is constrained for DD (note that we consider σ\sigma^{\prime} which are constrained for DD and not permutations constrained for DσD_{\sigma}). Once we establish that DσD_{\sigma} cannot be pumped in this fashion we employ Lemma 1 in the Appendix which guarantees that there exists a continuous and increasing utility function UU that satisfies U(𝐱σ(t))𝐩t𝐱σ(t)U(𝐱)𝐩t𝐱U(\mathbf{x}^{\sigma(t)})-\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x} for all 𝐱B(𝐩t,𝐩t𝐱t)\mathbf{x}\in B(\mathbf{p}^{t},\mathbf{p}^{t}\cdot\mathbf{x}^{t}). We then show that the amount of money which can be pumped with σ\sigma is weakly greater than the amount of quasilinear utility wasted according to UU; in other words, the extra utility the consumer could have gained by deviating from 𝐱t\mathbf{x}^{t}, subject to any deviation costing weakly less than 𝐩t𝐱t\mathbf{p}^{t}\cdot\mathbf{x}^{t}. This establishes TMPcQc\text{TMP}_{c}\geqslant Q_{c}.

3.3 Comparison to other money pump approaches

Here we compare our TMPc\text{TMP}_{c} with related measures introduced in Echenique, Lee, and Shum (2011) (henceforth ELS) and Smeulders, Cherchye, Spieksma, and De Rock (2013) (henceforth SCSD). The starting point for ELS is the observation that any violation of GARP (i.e. any sequence t1,t2,,tKt_{1},t_{2},\ldots,t_{K} with t1=tKt_{1}=t_{K} so that (6) holds with at least one strict inequality) can be exploited by an arbitrageur to pump money from the consumer. This observation led ELS to quantify the degree of the violation of GARP t1,t2,,tKt_{1},t_{2},\ldots,t_{K} in accordance with the amount of money which could be extracted by the arbitrageur. As a single dataset D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} can contain multiple violations of GARP it was proposed by ELS to take the average (either the mean or the median) of the amount of money which can be pumped (where the average is taken over each violation of GARP) in order to measure the degree of irrationality exhibited by the consumer. SCSD proved that calculating ELS’ average money pump (using either the mean or median) is NP-hard suggesting that this measure can be difficult to calculate in practice. SCSD proposed taking the maximum amount of money which can be pumped from the consumer through any single violation of GARP (i.e. any sequence t1,t2,,tKt_{1},t_{2},\ldots,t_{K} with t1=tKt_{1}=t_{K} so that (6) holds with at least one strict inequality). They show that this maximum money pump, in contrast to the average money pump, can be calculated in polynomial time. Recall that from Theorem 4 we know that our measure TMPc\text{TMP}_{c} can be calculated by solving a linear programming problem and thus our measure too can be calculated in polynomial time.

The main difference between our measure, TMPc\text{TMP}_{c}, and the measures introduced by ELS and SCSD is that our index is the amount of money which can be extracted using the optimal trading strategy of the arbitrageur. On the other hand, the indices of ELS and SCSD aggregate (using either an average or a maximum) the amount of money which can be extracted over each violation of GARP whether or not the optimal strategy of the arbitrageur would actually exploit this violation (and, as we shall see in the examples below, he may not). We also note that there are no theoretical results connecting either the measure of ELS or the measure of SCSD to quasilinear or additive rationalizations (or any other rationalization concept) in the sense of our Theorem 4.

To further elucidate the differences between our TMPc\text{TMP}_{c} and the measures of ELS and SCSD we present two examples.

Example 1.

Suppose there are two goods and three observations. Let 𝐱1=(1,2)\mathbf{x}^{1}=(1,2), 𝐱2=(2,1)\mathbf{x}^{2}=(2,1), and 𝐱3=(53,53)\mathbf{x}^{3}=(\tfrac{5}{3},\tfrac{5}{3}) and let 𝐩1=(1,2)\mathbf{p}^{1}=(1,2), 𝐩2=(2,1)\mathbf{p}^{2}=(2,1), 𝐩3=(2,1)\mathbf{p}^{3}=(2,1). Note that the budget set in observations 2 and 3 are the same and so the budget sets in this example are the same as those displayed in Figure 1(a). It is easy to check that the violations of GARP are observation sequences (1,2)(1,2), (1,3)(1,3), (1,2,3)(1,2,3), and (1,3,2)(1,3,2).999To confirm, for instance, that (1,3)(1,3) is indeed a violation of GARP just note that 𝐩1(𝐱1𝐱3)=0\mathbf{p}^{1}\cdot(\mathbf{x}^{1}-\mathbf{x}^{3})=0 and 𝐩3(𝐱3𝐱1)=1\mathbf{p}^{3}\cdot(\mathbf{x}^{3}-\mathbf{x}^{1})=1 and thus (6) holds with one strict inequality for t=1,3t=1,3. The amounts of money which can be pumped from each violation are: 22, 11, 22, and 11, respectively.101010To calculate the amount of money which can be pumped, for instance, from sequence (1,3)(1,3) just take 𝐩1(𝐱3𝐱1)+𝐩3(𝐱1𝐱3)=0+1=1\mathbf{p}^{1}\cdot(\mathbf{x}^{3}-\mathbf{x}^{1})+\mathbf{p}^{3}\cdot(\mathbf{x}^{1}-\mathbf{x}^{3})=0+1=1. ELS’ mean and median money pumps are thus both equal to 1.51.5. On the other hand, the optimal strategy for the arbitrageur is to ignore observation 3 and pump via observations 1 and 2 and thus TMPc=2\text{TMP}_{c}=2 (the amount of money which can be extracted from observations 1 and 2).

Because ELS measure the average of the money pumps it is possible that a more rational dataset (in the sense that it has fewer GARP violations) can actually have a higher average money pump. For instance, if the choice in observation 3 of this example were perturbed slightly to 𝐱~3=(53ε,53+2ε)\tilde{\mathbf{x}}^{3}=(\tfrac{5}{3}-\varepsilon,\tfrac{5}{3}+2\varepsilon) for some small ε>0\varepsilon>0 then the only GARP violations are the observation sequences (1,2)(1,2) and (1,2,3)(1,2,3) and thus ELS’ average money pump would be 22. Thus surprisingly, we see that a perturbation to the data which made the data more rational (it removed several violations of GARP) resulted in ELS’ index actually increasing in value. Note that this perturbation has no effect on TMPc\text{TMP}_{c}.

Example 2.

Suppose there are four goods and four observations. In each observation t{1,2,3,4}t\in\{1,2,3,4\} the consumer purchases 1 unit of good tt and 0 units of all other goods. Thus, 𝐱1=(1,0,0,0)\mathbf{x}^{1}=(1,0,0,0), 𝐱2=(0,1,0,0)\mathbf{x}^{2}=(0,1,0,0), 𝐱3=(0,0,1,0)\mathbf{x}^{3}=(0,0,1,0), and 𝐱4=(0,0,0,1)\mathbf{x}^{4}=(0,0,0,1). Let 𝐩1=(4,2,8,1)\mathbf{p}^{1}=(4,2,8,1), 𝐩2=(2,4,8,8)\mathbf{p}^{2}=(2,4,8,8), 𝐩3=(8,8,4,2)\mathbf{p}^{3}=(8,8,4,2), and 𝐩4=(2,8,2,4)\mathbf{p}^{4}=(2,8,2,4). Note that in observation 1 the consumer purchased 𝐱1=(1,0,0,0)\mathbf{x}^{1}=(1,0,0,0) but could have attained either 𝐱2=(0,1,0,0)\mathbf{x}^{2}=(0,1,0,0) or 𝐱4=(0,0,0,1)\mathbf{x}^{4}=(0,0,0,1) for less money. Similarly, in period 2 the consumer could have purchased 𝐱1\mathbf{x}^{1} for less money, in period 3 the consumer could have purchased 𝐱4\mathbf{x}^{4} for less money, and in period 4 the consumer could have purchased either 𝐱1\mathbf{x}^{1} or 𝐱3\mathbf{x}^{3} for less money. Using these remarks it is easy to show that the violations of GARP are observation sequences: (1,2)(1,2), (1,4)(1,4), and (3,4)(3,4). The amounts of money which can be pumped are: 44, 55, and 44, respectively. The maximum money pump of SCSD is thus 55. Note however that the arbitrageur would not wish to pump via observations (1,4)(1,4) (these being the observations corresponding to the money pump amount of 55) as the arbitrageur could do better by pumping via observations (1,2)(1,2) and (3,4)(3,4) (this corresponds to using the permutation σ\sigma which satisfies σ(1)=2,σ(2)=1,σ(3)=4,σ(4)=3\sigma(1)=2,\sigma(2)=1,\sigma(3)=4,\sigma(4)=3) as following this strategy nets the arbitrageur a total of 88. Thus, while the maximum money pump is 55 we see that TMPc=8\text{TMP}_{c}=8.

The two preceding examples help make clear the distinction between our measure, which corresponds to the arbitrageur’s optimal strategy, with the measures of ELS and SCSD. In Example 1 we see that ELS’ average money pump incorporates several small violations of GARP which the arbitrageur’s optimal strategy ignores. Similarly, in Example 2 we that SCSD’s maximum money pump exploits the most severe single violation of GARP however the arbitrageur’s optimal strategy ignores this severe violation because he can make even more money by pumping two smaller violations.

4 Conclusion

In this article we propose two notions of the money pump. The total money pump (TMP) index is the total amount of money which can be extracted from the consumer via an arbitrage strategy. We show in Theorem 2 that this money pump is equivalent to a measure of additive cost inefficiency and is also equivalent to the measure of quasilinear utility inefficiency proposed by Allen and Rehbeck (2021). The constrained total money pump (TMPc) index, is the total amount of money which can be extracted from the consumer via an arbitrage strategy, with the added condition that the arbitrageur must make money in each round in which he enacts his strategy. Theorem 4 shows that the constrained total money pump is equivalent to a measure of constrained additive cost inefficiency and constrained quasilinear utility inefficiency.

References

  • Afriat (1967) S. N. Afriat. The construction of utility functions from expenditure data. International Economic Review, 8(1):67–77, 1967.
  • Afriat (1973) S. N. Afriat. On a system of inequalities in demand analysis: An extension of the classical method. International Economic Review, 14(2):460–472, 1973.
  • Allen and Rehbeck (2021) Roy Allen and John Rehbeck. Satisficing, aggregation, and quasilinear utility. October 2021.
  • Apesteguia and Ballester (2015) Jose Apesteguia and Miguel A. Ballester. A measure of rationality and welfare. Journal of Political Economy, 123(6):1278–1310, 2015. ISSN 00223808, 1537534X. URL https://www.jstor.org/stable/10.1086/683838.
  • Brown and Calsamiglia (2007) Donald J. Brown and Caterina Calsamiglia. The nonparametric approach to applied welfare analysis. Economic Theory, 31(1):183–188, 2007. ISSN 09382259, 14320479. URL http://www.jstor.org/stable/27822509.
  • Browning (1989) Martin Browning. A nonparametric test of the life-cycle rational expections hypothesis. International Economic Review, 30(4):979–992, 1989. ISSN 00206598, 14682354. URL http://www.jstor.org/stable/2526762.
  • Dean and Martin (2016) Mark Dean and Daniel Martin. Measuring Rationality with the Minimum Cost of Revealed Preference Violations. The Review of Economics and Statistics, 98(3):524–534, 07 2016. ISSN 0034-6535.
  • Diewert (1973) W. E. Diewert. Afriat and revealed preference theory. Review of Economic Studies, 40(3):419–425, 1973.
  • Echenique et al. (2011) F. Echenique, S. Lee, and M. Shum. The money pump as a measure of revealed preference violations. Journal of Political Economy, 119(6):1201–1223, 2011.
  • Halevy et al. (2018) Y. Halevy, D. Persitz, and L. Zrill. Parametric recoverability of preferences. Journal of Political Economy, 126(4):1558–1593, 2018.
  • Houtman and Maks (1985) M. Houtman and J. A. H. Maks. Determining all maximal data subsets consistent with revealed preference. Kwantitatieve Methoden, 6(19):89–104, 1985.
  • Smeulders et al. (2013) Bart Smeulders, Laurens Cherchye, Frits C. R. Spieksma, and Bram De Rock. The money pump as a measure of revealed preference violations: A comment. Journal of Political Economy, 121(6):1248–1258, 2013. ISSN 00223808, 1537534X. URL http://www.jstor.org/stable/10.1086/674077.
  • Varian (1982) H. R. Varian. The nonparametric approach to demand analysis. Econometrica, 50(4):945–973, 1982.
  • Varian (1990) H. R. Varian. Goodness-of-fit in optimizing models. Journal of Econometrics, 46(1-2):125–140, 1990.

Appendix A Additive Cost Efficiency and Afriat’s CCEI

Here we show that the additive cost inefficiency AA, as defined by (3), is in fact a version of Afriat’s CCEI (after applying a suitable normalization to AA). To proceed, we normalize AA by dividing by total expenditure

A~=infU(t=1T𝐩t𝐱teU)t=1T𝐩t𝐱t\tilde{A}=\inf_{U}\ \dfrac{\left(\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e^{U}\right)}{\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}}

Now, let D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} be some dataset and let UU be an arbitrary utility function. Let e¯Ut\bar{e}_{U}^{t} denote the smallest amount of money which the consumer could have spent in period tt to acquire a bundle giving as much utility as 𝐱t\mathbf{x}^{t}. That is, e¯Ut=inf{𝐩t𝐱:U(𝐱)U(𝐱t)}\bar{e}_{U}^{t}=\inf\{\mathbf{p}^{t}\cdot\mathbf{x}:U(\mathbf{x})\geqslant U(\mathbf{x}^{t})\}. Let 𝒰\mathcal{U} be some collection of utility functions. The CCEI for 𝒰\mathcal{U} is the number111111When 𝒰\mathcal{U} is the class of well-behaved utility functions then CCEI𝒰\text{CCEI}_{\mathcal{U}} can be expressed in terms of the extent to which the budget constraints need to be relaxed in order for the data to satisfy GARP. That is, the CCEI is equal to the infimum number ee so that for all t1,t2,,tKt_{1},t_{2},\ldots,t_{K} with t1=tKt_{1}=t_{K} we have (1e)𝐩tk𝐱tk𝐩tk𝐱tk+1,for all k{1,2,,K1}(1-e)\mathbf{p}^{t_{k}}\cdot\mathbf{x}^{t_{k}}\geqslant\mathbf{p}^{t_{k}}\cdot\mathbf{x}^{t_{k+1}},\qquad\qquad\text{for all }k\in\{1,2,\ldots,K-1\} implies that none of these inequalities hold strictly. See Halevy et al. (2018) for the proof that our definition of the CCEI and the version involving relaxed budget sets are in fact equivalent when 𝒰\mathcal{U} is the collection of well-behaved utility functions.

CCEI𝒰=infU𝒰supt(𝐩t𝐱te¯tU𝐩t𝐱t)\text{CCEI}_{\mathcal{U}}=\inf_{U\in\mathcal{U}}\sup_{t}\left(\dfrac{\mathbf{p}^{t}\cdot\mathbf{x}^{t}-\bar{e}_{t}^{U}}{\mathbf{p}^{t}\cdot\mathbf{x}^{t}}\right) (10)

In other words, the CCEI considers the percent of the budget set which is wasted in each period and aggregates the measure over periods by taking a supremum.

How does the CCEI relate to AA? To answer this question let us cease to consider D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} as TT separate purchasing occasions but rather let us consider DD as one giant purchasing occasion in which the consumer buys the bundle (𝐱1,𝐱2,,𝐱T)+TL(\mathbf{x}^{1},\mathbf{x}^{2},\ldots,\mathbf{x}^{T})\in\mathbb{R}_{+}^{TL} when prices are (𝐩1,𝐩2,,𝐩T)++TL(\mathbf{p}^{1},\mathbf{p}^{2},\ldots,\mathbf{p}^{T})\in\mathbb{R}_{++}^{TL}. Let 𝒰A\mathcal{U}_{A} denote the collection of utility functions VV which take the additive form V(𝐱~1,𝐱~2,,𝐱~T)=t=1TU(𝐱~t)V(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T})=\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t}) for some UU. It follows that

eU=inf{t=1T𝐩t𝐱~t:t=1TU(𝐱~t)t=1TU(𝐱t)}=e¯1Ve^{U}=\inf\left\{\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}:\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t})\geqslant\sum_{t=1}^{T}U(\mathbf{x}^{t})\right\}=\bar{e}_{1}^{V}

where V𝒰AV\in\mathcal{U}_{A} is the additive utility function with sub-utility function UU. Note that ‘1’ in the subscript of e¯1V\bar{e}_{1}^{V} denotes the single (giant) observation where (𝐱1,𝐱2,,𝐱T)(\mathbf{x}^{1},\mathbf{x}^{2},\ldots,\mathbf{x}^{T}) is purchased at prices (𝐩1,𝐩2,,𝐩T)(\mathbf{p}^{1},\mathbf{p}^{2},\ldots,\mathbf{p}^{T}). As eU=e¯1Ve^{U}=\bar{e}_{1}^{V} it is clear that A~=CCEI𝒰A\tilde{A}=\text{CCEI}_{\mathcal{U}_{A}}. Thus A~\tilde{A} can be thought of as a version of Afriat’s CCEI.

Appendix B Proofs

Proof of Theorem 1..

Let σ\sigma be some permutation of {1,2,,T}\{1,2,\ldots,T\} and note that if DD is quasilinear rationalized by UU then t=1TU(𝐱t)𝐩t𝐱tt=1TU(𝐱σ(t))𝐩t𝐱σ(t)\sum_{t=1}^{T}U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\sum_{t=1}^{T}U(\mathbf{x}^{\sigma(t)})-\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)} which, after rearranging, yields t=1T𝐩t(𝐱t𝐱σ(t))0\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})\leqslant 0 and thus item 5 implies item 1.

Next, suppose DD satisfies cyclical monotonicity. Let U:XU:X\rightarrow\mathbb{R} be defined by

U(𝐱)=inf(𝐩tK(𝐱𝐱tK)+k=1K1𝐩tk(𝐱tk+1𝐱tk))U(\mathbf{x})=\inf\left(\mathbf{p}^{t_{K}}\cdot(\mathbf{x}-\mathbf{x}^{t_{K}})+\sum_{k=1}^{K-1}\mathbf{p}^{t_{k}}\cdot(\mathbf{x}^{t_{k+1}}-\mathbf{x}^{t_{k}})\right) (11)

where the infimum is taken over all finite sequences t1,t2,,tKt_{1},t_{2},\ldots,t_{K}. As DD satisfies cyclical monotonicity it is easy to see that the infimum in (11) is always attained by some sequence t1,t2,,tKt_{1},t_{2},\ldots,t_{K} with at most TT elements. As such, UU is the pointwise infimum of finitely many well-behaved functions and is thus well-behaved. Let t{1,2,,T}t\in\{{1,2,\ldots,T}\} and let t~1,t~2,,t~K\tilde{t}_{1},\tilde{t}_{2},\ldots,\tilde{t}_{K} be the sequence which attains the infimum in (11) for U(𝐱t)U(\mathbf{x}^{t}). For any 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} we have

U(𝐱t)+𝐩t(𝐱𝐱t)=𝐩t(𝐱𝐱t)+𝐩t~K(𝐱t𝐱t~K)+k=1K1𝐩t~k(𝐱t~k+1𝐱t~k)U(𝐱)U(\mathbf{x}^{t})+\mathbf{p}^{t}\cdot(\mathbf{x}-\mathbf{x}^{t})=\mathbf{p}^{t}\cdot(\mathbf{x}-\mathbf{x}^{t})+\mathbf{p}^{\tilde{t}_{K}}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\tilde{t}_{K}})+\sum_{k=1}^{K-1}\mathbf{p}^{\tilde{t}_{k}}\cdot(\mathbf{x}^{\tilde{t}_{k+1}}-\mathbf{x}^{\tilde{t}_{k}})\geqslant U(\mathbf{x})

where the final inequality follows from the definition of UU. Rearranging the previous inequality gives U(𝐱t)𝐩t𝐱tU(𝐱)𝐩t𝐱U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x} and so DD is quasilinear rationalized by UU. Let (𝐱~1,𝐱~2,,𝐱~T)(\tilde{\mathbf{x}}^{1},\tilde{\mathbf{x}}^{2},\ldots,\tilde{\mathbf{x}}^{T}) satisfy t=1T𝐩t𝐱t(>)𝐩t𝐱~t\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant(>)\ \mathbf{p}^{t}\cdot\tilde{\mathbf{x}}^{t}. Then, as DD is quasilinear rationalized by UU we see t=1TU(𝐱t)t=1TU(𝐱~t)+𝐩t(𝐱t𝐱~t)(>)t=1TU(𝐱~t)\sum_{t=1}^{T}U(\mathbf{x}^{t})\geqslant\sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t})+\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\tilde{\mathbf{x}}^{t})\geqslant(>)\ \sum_{t=1}^{T}U(\tilde{\mathbf{x}}^{t}) and so DD is additively rationalized by UU. We have just shown that item 2 implies items 4 and 6. It is easy to see that items 1 and 2 are equivalent and that item 4 implies item 3 and item 6 implies item 5 and so the proof is complete. ∎

Proof of Theorem 2..

To show that Qε¯Q\geqslant\bar{\varepsilon} let UU be any utility function and define ut=U(𝐱t)u_{t}=U(\mathbf{x}^{t}) and εt=sups(us𝐩t𝐱s+ut𝐩t𝐱t)\varepsilon_{t}=\sup_{s}\big{(}u_{s}-\mathbf{p}^{t}\cdot\mathbf{x}^{s}+u_{t}-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\big{)}. It is easy to see that these numbers utu_{t} and εt\varepsilon_{t} constitute a feasible solution to (2.2) and further that t=1Tεt\sum_{t=1}^{T}\varepsilon_{t} lies below the quantity

t=1Tsup𝐱+L[U(𝐱)𝐩t𝐱][U(𝐱t)𝐩t𝐱t]\sum_{t=1}^{T}\sup_{\mathbf{x}\in\mathbb{R}_{+}^{L}}\left[U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\right]-\left[U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\right]

and so indeed Qε¯Q\geqslant\bar{\varepsilon}.

To see that ε¯TMP\bar{\varepsilon}\geqslant\text{TMP} let (u1,u2,,uT)(u_{1},u_{2},\ldots,u_{T}) and (ε1,ε2,,εT)(\varepsilon_{1},\varepsilon_{2},\ldots,\varepsilon_{T}) constitute a feasible solution to (2.2) and let σ\sigma be any permutation of {1,2,,T}\{1,2,\ldots,T\}. Using the constraint inequalities in (2.2) we see

t=1T𝐩t(𝐱t𝐱σ(t))=t=1T[uσ(t)ut+𝐩t(𝐱t𝐱σ(t))]t=1Tεt=ε¯\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})=\sum_{t=1}^{T}\left[u_{\sigma(t)}-u_{t}+\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})\right]\leqslant\sum_{t=1}^{T}\varepsilon_{t}=\bar{\varepsilon}

and so indeed ε¯TMP\bar{\varepsilon}\geqslant\text{TMP}.

To see that ATMPA\geqslant\text{TMP} let σ\sigma be any permutation of {1,2,,T}\{1,2,\ldots,T\} and note that for any utility function UU we have t=1TU(𝐱σ(t))=t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{\sigma(t)})=\sum_{t=1}^{T}U(\mathbf{x}^{t}) and so

t=1T𝐩t(𝐱t𝐱σ(t))t=1T𝐩t𝐱teU\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})\leqslant\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e^{U}

from which we see that indeed ATMPA\geqslant\text{TMP}.

Next, let σ\sigma be a permutation which achieves the supremum in the definition of the TMP (i.e. achieves the supremum in (2)). Let Dσ=(𝐩t,𝐱σ(t))tTD_{\sigma}=(\mathbf{p}^{t},\mathbf{x}^{\sigma(t)})_{t\leqslant T}. We claim that DσD_{\sigma} satisfies cyclical monotonicity. For a contradiction suppose that this is not the case and thus there exists some permutation σ\sigma^{\prime} which “money pumps” the dataset DσD_{\sigma} in the sense that t=1T𝐩t(𝐱σ(t)𝐱σ(σ(t)))>0\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{\sigma^{\prime}(\sigma(t))})>0. We have

0<t=1T𝐩t(𝐱σ(t)𝐱σ(σ(t)))=t=1T𝐩t(𝐱t𝐱σ(σ(t)))t=1T𝐩t(𝐱t𝐱σ(t))0<\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{\sigma^{\prime}(\sigma(t))})=\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma^{\prime}(\sigma(t))})-\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})

After rearranging we see that t=1T𝐩t(𝐱σ(σ(t))𝐱t)>t=1T𝐩t(𝐱σ(t)𝐱t)\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma^{\prime}(\sigma(t))}-\mathbf{x}^{t})>\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{t}) which contradicts the assumption that σ\sigma achieves the supremum in the definition of the TMP. Having achieved a contradiction we conclude that indeed DσD_{\sigma} satisfies cyclical monotonicity.

As DσD_{\sigma} satisfies cyclical monotonicity we may appeal to Theorem 1 to see that there exists a well-behaved UU which rationalizes DσD_{\sigma}. Therefore, t=1T[U(𝐱σ(t))𝐩t𝐱σ(t)][U(𝐱t)𝐩t𝐱t]=t=1T𝐩t(𝐱t𝐱σ(t))=TMP\sum_{t=1}^{T}[U(\mathbf{x}^{\sigma(t)})-\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)}]-[U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}]=\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})=\text{TMP} and so we see that TMPQ\text{TMP}\geqslant Q. Noting that t=1TU(𝐱σ(t))=t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{\sigma(t)})=\sum_{t=1}^{T}U(\mathbf{x}^{t}) delivers TMPA\text{TMP}\geqslant A. Thus, (5) holds and the infimum in the definitions of AA and QQ are attained by the well-behaved utility function UU. ∎

Lemma 1.

Let D=(𝐩t,𝐱t)tTD=(\mathbf{p}^{t},\mathbf{x}^{t})_{t\leqslant T} be a dataset and let 𝐦=(m1,m2,,mT)+T\mathbf{m}=(m^{1},m^{2},\ldots,m^{T})\in\mathbb{R}_{+}^{T} be a vector satisfying mt𝐩t𝐱tm^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{t} for all tt. Suppose that for all permutations σ\sigma satisfying mt𝐩t𝐱σ(t)m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)} for all tt we have t=1T𝐩t(𝐱t𝐱σ(t))0\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})\leqslant 0. Then, there exists a continuous and increasing utility function UU which satisfies U(𝐱t)𝐩t𝐱tU(𝐱)𝐩t𝐱U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x} for all tt and all 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} satisfying mt𝐩t𝐱m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}.

Proof.

Let β>0\beta>0 be some very large number. For each tt let ft:+Lf_{t}:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} be defined by

ft(𝐱)={𝐩t(𝐱𝐱t), if mt𝐩t𝐱β𝐩t(𝐱𝐱t), if mt<𝐩t𝐱f_{t}(\mathbf{x})=\begin{cases}\mathbf{p}^{t}\cdot(\mathbf{x}-\mathbf{x}^{t}),&\qquad\text{ if }m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}\\ \beta\mathbf{p}^{t}\cdot(\mathbf{x}-\mathbf{x}^{t}),&\qquad\text{ if }m^{t}<\mathbf{p}^{t}\cdot\mathbf{x}\end{cases}

Note that each ftf_{t} is increasing and continuous. Let U:+LU:\mathbb{R}_{+}^{L}\rightarrow\mathbb{R} be defined by

U(𝐱)=inf(ftK(𝐱)+k=1K1ftk(𝐱tk+1))U(\mathbf{x})=\inf\left(f_{t_{K}}(\mathbf{x})+\sum_{k=1}^{K-1}f_{t_{k}}(\mathbf{x}^{t_{k+1}})\right) (12)

where the infimum is taken over all finite sequences t1,t2,,tKt_{1},t_{2},\ldots,t_{K}. From our assumptions on DD we can, by taking β\beta sufficiently large, ensure that (i) for each 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} the infimum in (12) is attained by some finite sequence t1,t2,,tKt_{1},t_{2},\ldots,t_{K} which has at most TT elements and (ii) for all tt and all sequences t1,t2,,tKt_{1},t_{2},\ldots,t_{K} which attain the infimum in (12) with 𝐱=𝐱t\mathbf{x}=\mathbf{x}^{t} we have mtK𝐩tK𝐱tm^{t_{K}}\geqslant\mathbf{p}^{t_{K}}\cdot\mathbf{x}^{t} and mtk𝐩tk𝐱tk+1m^{t_{k}}\geqslant\mathbf{p}^{t_{k}}\cdot\mathbf{x}^{t_{k+1}} for all and k<Kk<K.

By property (i) we see that UU is the pointwise infimum of finitely many increasing and continuous functions and is thus increasing and continuous. Let t{1,2,,T}t\in\{{1,2,\ldots,T}\} and let t~1,t~2,,t~K\tilde{t}_{1},\tilde{t}_{2},\ldots,\tilde{t}_{K} be the sequence which attains the infimum in (12) for U(𝐱t)U(\mathbf{x}^{t}). For any 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} satisfying mt𝐩t𝐱m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x} we may use property (ii) to see that

U(𝐱t)+ft(𝐱)=ft(𝐱)+ft~K(𝐱t)+k=1K1ft~k(𝐱t~k+1)U(𝐱)U(\mathbf{x}^{t})+f_{t}(\mathbf{x})=f_{t}(\mathbf{x})+f_{\tilde{t}_{K}}(\mathbf{x}^{t})+\sum_{k=1}^{K-1}f_{\tilde{t}_{k}}(\mathbf{x}^{\tilde{t}_{k+1}})\geqslant U(\mathbf{x})

where the final inequality follows from the definition of UU. Rearranging the previous inequality and using the assumption that mt𝐩t𝐱m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x} gives U(𝐱t)𝐩t𝐱tU(𝐱)𝐩t𝐱U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x} and thus the proof is complete. ∎

Proof of Theorem 3..

As noted, the equivalence between items 2-4 is well-known and is part of Afriat’s Theorem and so we omit the proof. Also as noted, the equivalence between items 1 and 2 and the equivalence between items 4 and 5 are obvious and so we also do not prove these results either. Clearly item 6 implies item 3 and so to complete the proof it suffices to show that item 1 implies item 6. So, suppose TMPc=0\text{TMP}_{c}=0. Take 𝐦=(m1,m2,,mT)\mathbf{m}=(m^{1},m^{2},\ldots,m^{T}) where mt=𝐩t𝐱tm^{t}=\mathbf{p}^{t}\cdot\mathbf{x}^{t}. It is easy to see that DD and 𝐦\mathbf{m} satisfy the hypothesis in Lemma 1 and so the lemma provides an increasing and continuous utility function UU which satisfies U(𝐱t)𝐩t𝐱tU(𝐱)𝐩t𝐱U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x} for all 𝐱+L\mathbf{x}\in\mathbb{R}_{+}^{L} satisfying 𝐩t𝐱t𝐩t𝐱\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}. In other words, DD is constrained quasilinear rationalized by UU and so the proof is complete. ∎

Proof of Theorem 4..

To show that Qcε¯cQ_{c}\geqslant\bar{\varepsilon}_{c} let UU be any utility function and define ut=U(𝐱t)u_{t}=U(\mathbf{x}^{t}) and εt=sups(us𝐩t𝐱s+ut𝐩t𝐱t)\varepsilon_{t}=\sup_{s}\big{(}u_{s}-\mathbf{p}^{t}\cdot\mathbf{x}^{s}+u_{t}-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\big{)} where the supremum is taken over all ss such that 𝐩t𝐱t𝐩t𝐱s\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{s}. It is easy to see that these numbers utu_{t} and εt\varepsilon_{t} constitute a feasible solution to (8) and further that t=1Tεt\sum_{t=1}^{T}\varepsilon_{t} lies below the quantity

t=1Tsup𝐱B(𝐩t,𝐩t𝐱t)[U(𝐱)𝐩t𝐱][U(𝐱t)𝐩t𝐱t]\sum_{t=1}^{T}\sup_{\mathbf{x}\in B(\mathbf{p}^{t},\mathbf{p}^{t}\cdot\mathbf{x}^{t})}\left[U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x}\right]-\left[U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}\right]

and so indeed Qcε¯cQ_{c}\geqslant\bar{\varepsilon}_{c}.

To see that ε¯cTMPc\bar{\varepsilon}_{c}\geqslant\text{TMP}_{c} let (u1,u2,,uT)(u_{1},u_{2},\ldots,u_{T}) and (ε1,ε2,,εT)(\varepsilon_{1},\varepsilon_{2},\ldots,\varepsilon_{T}) constitute a feasible solution to (8) and let σ\sigma be any constrained permutation of {1,2,,T}\{1,2,\ldots,T\}. Using the constraint inequalities in (8) we see

t=1T𝐩t(𝐱t𝐱σ(t))=t=1T[uσ(t)ut+𝐩t(𝐱t𝐱σ(t))]t=1Tεt=ε¯c\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})=\sum_{t=1}^{T}\left[u_{\sigma(t)}-u_{t}+\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})\right]\leqslant\sum_{t=1}^{T}\varepsilon_{t}=\bar{\varepsilon}_{c}

and so indeed ε¯cTMPc\bar{\varepsilon}_{c}\geqslant\text{TMP}_{c}.

To see that AcTMPcA_{c}\geqslant\text{TMP}_{c} let σ\sigma be any constrained permutation of {1,2,,T}\{1,2,\ldots,T\} and note that for any utility function UU we have t=1TU(𝐱σ(t))=t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{\sigma(t)})=\sum_{t=1}^{T}U(\mathbf{x}^{t}) and so

t=1T𝐩t(𝐱t𝐱σ(t))t=1T𝐩t𝐱teU\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})\leqslant\sum_{t=1}^{T}\mathbf{p}^{t}\cdot\mathbf{x}^{t}-e^{U}

from which we see that indeed AcTMPcA_{c}\geqslant\text{TMP}_{c}.

Next, let σ\sigma be a constrained permutation which achieves the supremum in definition of the TMPc\text{TMP}_{c}. Let Dσ=(𝐩t,𝐱σ(t))tTD_{\sigma}=(\mathbf{p}^{t},\mathbf{x}^{\sigma(t)})_{t\leqslant T} and let 𝐦=(m1,m2,,mT)\mathbf{m}=(m^{1},m^{2},\ldots,m^{T}) where mt=𝐩t𝐱tm^{t}=\mathbf{p}^{t}\cdot\mathbf{x}^{t} for all tt. We claim that DσD_{\sigma} and 𝐦\mathbf{m} satisfy the hypotheses of Lemma 1 in the sense that for any permutation σ\sigma^{\prime} satisfying mt𝐩t𝐱σ(σ(t))m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma^{\prime}(\sigma(t))} we have t=1T𝐩t(𝐱σ(t)𝐱σ(σ(t)))0\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{\sigma^{\prime}(\sigma(t))})\leqslant 0. For a contradiction suppose that this is not the case and thus there exists a permutation σ\sigma^{\prime} satisfying (i) mt𝐩t𝐱σ(σ(t))m^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma^{\prime}(\sigma(t))} for all tt and (ii) t=1T𝐩t(𝐱σ(t)𝐱σ(σ(t)))>0\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{\sigma^{\prime}(\sigma(t))})>0. Using (i) and the fact that σ\sigma is a constrained permutation for DD we see that for all tt we have 𝐩t𝐱t𝐩t𝐱σ(t)𝐩t𝐱σ(σ(t))\mathbf{p}^{t}\cdot\mathbf{x}^{t}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)}\geqslant\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma^{\prime}(\sigma(t))} and thus σσ\sigma^{\prime}\circ\sigma is a constrained permutation for DD. Using (ii) we see

0<t=1T𝐩t(𝐱σ(t)𝐱σ(σ(t)))=t=1T𝐩t(𝐱σ(t)𝐱t)t=1T𝐩t(𝐱σ(σ(t))𝐱t)0<\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{\sigma^{\prime}(\sigma(t))})=\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{t})-\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma^{\prime}(\sigma(t))}-\mathbf{x}^{t})

After rearranging we see that t=1T𝐩t(𝐱σ(σ(t))𝐱t)>t=1T𝐩t(𝐱σ(t)𝐱t)\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma^{\prime}(\sigma(t))}-\mathbf{x}^{t})>\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{\sigma(t)}-\mathbf{x}^{t}) which contradicts the assumption that σ\sigma achieves the supremum in the definition of TMPc\text{TMP}_{c} (recall that we have shown that σσ\sigma^{\prime}\circ\sigma is a constrained permutation for DD). Having achieved a contradiction we conclude that indeed DσD_{\sigma} and 𝐦\mathbf{m} satisfy the hypotheses in Lemma 1 and so the lemma guarantees that there exists a continuous and increasing utility function UU which satisfies U(𝐱σ(t))𝐩t𝐱σ(t)U(𝐱)𝐩t𝐱U(\mathbf{x}^{\sigma(t)})-\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)}\geqslant U(\mathbf{x})-\mathbf{p}^{t}\cdot\mathbf{x} for all 𝐱B(𝐩t,𝐩t𝐱t)\mathbf{x}\in B(\mathbf{p}^{t},\mathbf{p}^{t}\cdot\mathbf{x}^{t}). Therefore, t=1T[U(𝐱σ(t))𝐩t𝐱σ(t)][U(𝐱t)𝐩t𝐱t]=t=1T𝐩t(𝐱t𝐱σ(t))=TMPc\sum_{t=1}^{T}[U(\mathbf{x}^{\sigma(t)})-\mathbf{p}^{t}\cdot\mathbf{x}^{\sigma(t)}]-[U(\mathbf{x}^{t})-\mathbf{p}^{t}\cdot\mathbf{x}^{t}]=\sum_{t=1}^{T}\mathbf{p}^{t}\cdot(\mathbf{x}^{t}-\mathbf{x}^{\sigma(t)})=\text{TMP}_{c} and so we see that TMPcQc\text{TMP}_{c}\geqslant Q_{c}. Noting that t=1TU(𝐱σ(t))=t=1TU(𝐱t)\sum_{t=1}^{T}U(\mathbf{x}^{\sigma(t)})=\sum_{t=1}^{T}U(\mathbf{x}^{t}) delivers TMPcAc\text{TMP}_{c}\geqslant A_{c}. Thus, (9) holds and the infimum in the definitions of AcA_{c} and QcQ_{c} are attained by the continuous and increasing utility function UU. ∎