Robinson (1951) showed that the learning process of Discrete Fictitious Play converges from any initial condition to the set of Nash equilibria in two-player zero-sum games. In several earlier works, Brown (1949, 1951) makes some heuristic arguments for a similar convergence result for the case...

The Rubinstein alternating offers bargaining game is reconsidered under the assumption that each player is loss averse and the associated reference point is equal to the highest turned down offer of the opponent in the past. This makes the payoffs and therefore potential equilibrium strategies...

In this paper we study three different types of loss aversion equilibria in bimatrix games. 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...

Robinson (1951) showed that the learning process of Discrete Fictitious Play converges from any initial condition to the set of Nash equilibria in two-player zero-sum games. In several earlier works, Brown (1949, 1951) makes some heuristic arguments for a similar convergence result for the case...

The Rubinstein alternating offers bargaining game is reconsidered under the assumption that each player is loss averse and the associated reference point is equal to the highest turned down offer of the opponent in the past. This makes the payoffs and therefore potential equilibrium strategies...