Regret (decision theory)

Regret theory is a model in theoretical economics simultaneously developed in 1982 by Graham Loomes and Robert Sugden,^[1] David E. Bell,^[2] and Peter C. Fishburn.^[3] Regret theory models choice under uncertainty taking into account the effect of anticipated regret. Subsequently, several other authors improved upon it.^[4]

It incorporates a regret term in the utility function which depends negatively on the realized outcome and positively on the best alternative outcome given the uncertainty resolution. This regret term is usually an increasing, continuous and non-negative function subtracted to the traditional utility index. These type of preferences always violate transitivity in the traditional sense,^[5] although most satisfy a weaker version.^[4]

For independent lotteries and when regret is evaluated over the difference between utilities and then averaged over the all combinations of outcomes, the regret can still be transitive but for only specific form of regret functional. It is shown that only hyperbolic sine function will maintain this property.^[6] This form of regret inherits most of desired features, such as holding right preferences in face of first order stochastic dominance, risk averseness for logarithmic utilities and the ability to explain Allais paradox.

Regret aversion is not only a theoretical economics model, but a cognitive bias occurring as a decision has been made to abstain from regretting an alternative decision. To better preface, regret aversion can be seen through fear by either commission or omission; the prospect of committing to a failure or omitting an opportunity that we seek to avoid.^[7] Regret, feeling sadness or disappointment over something that has happened, can be rationalized for a certain decision, but can guide preferences and can lead people astray. This contributes to the spread of disinformation because things are not seen as one's personal responsibility.

Several experiments over both incentivized and hypothetical choices attest to the magnitude of this effect.

Experiments in first price auctions show that by manipulating the feedback the participants expect to receive, significant differences in the average bids are observed.^[8] In particular, "Loser's regret" can be induced by revealing the winning bid to all participants in the auction, and thus revealing to the losers whether they would have been able to make a profit and how much could it have been (a participant that has a valuation of $50, bids $30 and finds out the winning bid was $35 will also learn that he or she could have earned as much as $15 by bidding anything over $35.) This in turn allows for the possibility of regret and if bidders correctly anticipate this, they would tend to bid higher than in the case where no feedback on the winning bid is provided in order to decrease the possibility of regret.

In decisions over lotteries, experiments also provide supporting evidence of anticipated regret.^[9][10][11] As in the case of first price auctions, differences in feedback over the resolution of the uncertainty can cause the possibility of regret and if this is anticipated, it may induce different preferences. For example, when faced with a choice between $40 with certainty and a coin toss that pays $100 if the outcome is guessed correctly and $0 otherwise, not only does the certain payment alternative minimizes the risk but also the possibility of regret, since typically the coin will not be tossed (and thus the uncertainty not resolved) while if the coin toss is chosen, the outcome that pays $0 will induce regret. If the coin is tossed regardless of the chosen alternative, then the alternative payoff will always be known and then there is no choice that will eliminate the possibility of regret.

Anticipated regret tends to be overestimated for both choices and actions over which people perceive themselves to be responsible.^[12][13] People are particularly likely to overestimate the regret they will feel when missing a desired outcome by a narrow margin. In one study, commuters predicted they would experience greater regret if they missed a train by 1 minute more than missing a train by 5 minutes, for example, but commuters who actually missed their train by 1 or 5 minutes experienced (equal and) lower amounts of regret. Commuters appeared to overestimate the regret they would feel when missing the train by a narrow margin, because they tended to underestimate the extent to which they would attribute missing the train to external causes (e.g., missing their wallet or spending less time in the shower).^[12]

Besides the traditional setting of choices over lotteries, regret aversion has been proposed as an explanation for the typically observed overbidding in first price auctions,^[14] and the disposition effect,^[15] among others.

The minimax regret approach is to minimize the worst-case regret, originally presented by Leonard Savage in 1951.^[16] The aim of this is to perform as closely as possible to the optimal course. Since the minimax criterion applied here is to the regret (difference or ratio of the payoffs) rather than to the payoff itself, it is not as pessimistic as the ordinary minimax approach. Similar approaches have been used in a variety of areas such as:

• Hypothesis testing
• Prediction
• Economics

One benefit of minimax (as opposed to expected regret) is that it is independent of the probabilities of the various outcomes: thus if regret can be accurately computed, one can reliably use minimax regret. However, probabilities of outcomes are hard to estimate.

This differs from the standard minimax approach in that it uses differences or ratios between outcomes, and thus requires interval or ratio measurements, as well as ordinal measurements (ranking), as in standard minimax.

Suppose an investor has to choose between investing in stocks, bonds or the money market, and the total return depends on what happens to interest rates. The following table shows some possible returns:

The crude maximin choice based on returns would be to invest in the money market, ensuring a return of at least 1. However, if interest rates fell then the regret associated with this choice would be large. This would be 11, which is the difference between the 12 which could have been received if the outcome had been known in advance and the 1 received. A mixed portfolio of about 11.1% in stocks and 88.9% in the money market would have ensured a return of at least 2.22; but, if interest rates fell, there would be a regret of about 9.78.

The regret table for this example, constructed by subtracting actual returns from best returns, is as follows:

Therefore, using a minimax choice based on regret, the best course would be to invest in bonds, ensuring a regret of no worse than 5. A mixed investment portfolio would do even better: 61.1% invested in stocks, and 38.9% in the money market would produce a regret no worse than about 4.28.

What follows is an illustration of how the concept of regret can be used to design a linear estimator. In this example, the problem is to construct a linear estimator of a finite-dimensional parameter vector ${\displaystyle x}$  from its noisy linear measurement with known noise covariance structure. The loss of reconstruction of ${\displaystyle x}$  is measured using the mean-squared error (MSE). The unknown parameter vector is known to lie in an ellipsoid ${\displaystyle E}$  centered at zero. The regret is defined to be the difference between the MSE of the linear estimator that doesn't know the parameter ${\displaystyle x}$ , and the MSE of the linear estimator that knows ${\displaystyle x}$ . Also, since the estimator is restricted to be linear, the zero MSE cannot be achieved in the latter case. In this case, the solution of a convex optimization problem gives the optimal, minimax regret-minimizing linear estimator, which can be seen by the following argument.

According to the assumptions, the observed vector ${\displaystyle y}$  and the unknown deterministic parameter vector ${\displaystyle x}$  are tied by the linear model

${\displaystyle y=Hx+w}$ 

where ${\displaystyle H}$  is a known ${\displaystyle n\times m}$  matrix with full column rank ${\displaystyle m}$ , and ${\displaystyle w}$  is a zero mean random vector with a known covariance matrix ${\displaystyle C_{w}}$ .

Let

${\displaystyle {\hat {x}}=Gy}$ 

be a linear estimate of ${\displaystyle x}$  from ${\displaystyle y}$ , where ${\displaystyle G}$  is some ${\displaystyle m\times n}$  matrix. The MSE of this estimator is given by

${\displaystyle MSE=E\left(||{\hat {x}}-x||^{2}\right)=Tr(GC_{w}G^{*})+x^{*}(I-GH)^{*}(I-GH)x.}$ 

Since the MSE depends explicitly on ${\displaystyle x}$  it cannot be minimized directly. Instead, the concept of regret can be used in order to define a linear estimator with good MSE performance. To define the regret here, consider a linear estimator that knows the value of the parameter ${\displaystyle x}$ , i.e., the matrix ${\displaystyle G}$  can explicitly depend on ${\displaystyle x}$ :

${\displaystyle {\hat {x}}^{o}=G(x)y.}$ 

The MSE of ${\displaystyle {\hat {x}}^{o}}$  is

${\displaystyle MSE^{o}=E\left(||{\hat {x}}^{o}-x||^{2}\right)=Tr(G(x)C_{w}G(x)^{*})+x^{*}(I-G(x)H)^{*}(I-G(x)H)x.}$ 

To find the optimal ${\displaystyle G(x)}$ , ${\displaystyle MSE^{o}}$  is differentiated with respect to ${\displaystyle G}$  and the derivative is equated to 0 getting

${\displaystyle G(x)=xx^{*}H^{*}(C_{w}+Hxx^{*}H^{*})^{-1}.}$ 

Then, using the Matrix Inversion Lemma

${\displaystyle G(x)={\frac {1}{1+x^{*}H^{*}C_{w}^{-1}Hx}}xx^{*}H^{*}C_{w}^{-1}.}$ 

Substituting this ${\displaystyle G(x)}$  back into ${\displaystyle MSE^{o}}$ , one gets

${\displaystyle MSE^{o}={\frac {x^{*}x}{1+x^{*}H^{*}C_{w}^{-1}Hx}}.}$ 

This is the smallest MSE achievable with a linear estimate that knows ${\displaystyle x}$ . In practice this MSE cannot be achieved, but it serves as a bound on the optimal MSE. The regret of using the linear estimator specified by ${\displaystyle G}$  is equal to

${\displaystyle R(x,G)=MSE-MSE^{o}=Tr(GC_{w}G^{*})+x^{*}(I-GH)^{*}(I-GH)x-{\frac {x^{*}x}{1+x^{*}H^{*}C_{w}^{-1}Hx}}.}$ 

The minimax regret approach here is to minimize the worst-case regret, i.e., ${\displaystyle \sup _{x\in E}R(x,G).}$  This will allow a performance as close as possible to the best achievable performance in the worst case of the parameter ${\displaystyle x}$ . Although this problem appears difficult, it is an instance of convex optimization and in particular a numerical solution can be efficiently calculated.^[17] Similar ideas can be used when ${\displaystyle x}$  is random with uncertainty in the covariance matrix.^[18][19]

Camara, Hartline and Johnsen^[20] study principal-agent problems. These are incomplete-information games between two players called Principal and Agent, whose payoffs depend on a state of nature known only by the Agent. The Principal commits to a policy, then the agent responds, and then the state of nature is revealed. They assume that the principal and agent interact repeatedly, and may learn over time from the state history, using reinforcement learning. They assume that the agent is driven by regret-aversion. In particular, the agent minimizes his counterfactual internal regret. Based on this assumption, they develop mechanisms that minimize the principal's regret.

Collina, Roth and Shao^[21] improve their mechanism both in running-time and in the bounds for regret (as a function of the number of distinct states of nature).

• Regret-free mechanism
• Competitive regret
• Decision theory
• Info-gap decision theory
• Loss function
• Minimax
• Swap regret
• Wald's maximin model

• "TUTORIAL G05: Decision theory". Archived from the original on 3 July 2015.