Goal Gradient.

AA Ashton Anderson
EG Etan A. Green
request Request a Protocol
ask Ask a question
Favorite

Our model also implies a goal gradient, or that a reference-dependent player will be more willing to play as her rating approaches the reference point. To see this, compare two players with ratings short of the reference point. For the first player, r1 + Δ > θ—i.e., a win would push her rating past the reference point. For the second player, r2 + Δ ≤ θ—i.e., a win would not push her rating past the reference point. The model predicts a goal gradient if player 1’s threshold for playing is lower than player 2’s.

Player 1 plays if α>kΔ+c(e1)(k+ϵ)F(e1), as in Eq. 7, with e1 solving the first-order condition in Eq. 4. Player 2 plays if α>kΔ+c(e2)kF(e2), with e2 solving the first-order condition in Eq. 2. Hence, player 1’s threshold for playing is lower if (k+ϵ)F(e1)c(e1)>kF(e2)c(e2), i.e., if the expected net gain from winning (in utiles) is greater for player 1 than for player 2. This condition always holds. The player exerts effort until marginal gains equal marginal costs. Since e1>e2, player 1 exerts more effort than player 2, implying that net gains are larger for player 1.

Do you have any questions about this protocol?

Post your question to gather feedback from the community. We will also invite the authors of this article to respond.

post Post a Question
0 Q&A