On Loss Aversion in Bimatrix Games

• DOI: 10.1007/s11238-008-9102-6
• Publication Date: 2008-04-01T23:36:28Z
• Authors: Bram Driesen; Andrés Perea; Hans Peters
• Keywords: RISK; Decision Sciences(all); reference-dependence; Social Sciences(all); Economics, Econometrics and Finance(all); 02 engineering and technology; bimatrix games; Computer Science Applications; loss aversion; MODEL; EQUILIBRIUM; PROSPECT-THEORY; 0202 electrical engineering, electronic engineering, information engineering; mathematical economics;; Applied Psychology

In this article three different types of loss aversion equilibria in bimatrix games are studied. Loss aversion equilibria are Nash equilibria of games where players are loss averse and where the reference points—points below which they consider payoffs to be losses—are endogenous to the equilibrium calculation. The first type is the fixed point loss aversion equilibrium, introduced in Shalev (2000; Int. J. Game Theory 29(2):269) under the name of ‘myopic loss aversion equilibrium.’ There, the players’ reference points depend on the beliefs about their opponents’ strategies. The second type, the maximin loss aversion equilibrium, differs from the fixed point loss aversion equilibrium in that the reference points are only based on the carriers of the strategies, not on the exact probabilities. In the third type, the safety level loss aversion equilibrium, the reference points depend on the values of the own payoff matrices. Finally, a comparative statics analysis is carried out of all three equilibrium concepts in 2 × 2 bimatrix games. It is established when a player benefits from his opponent falsely believing that he is loss averse.