Proposed algorithm to fight anchoring bias

post by John_Maxwell (John_Maxwell_IV) · 2019-08-03T04:07:41.484Z · score: 10 (2 votes) · LW · GW · 2 comments

Anchoring is a classic cognitive bias which has been discussed on Less Wrong before [LW · GW]. Anchoring seems very difficult to avoid. Experiments have found that warning subjects about anchoring, or giving them cash incentives, doesn't solve the problem.

Here's an algorithm to fight anchoring that I would like to see a researcher test, based on binary search:

  1. Tell subjects to think of a number which is clearly too high for the quantity they want to estimate (an upper bound).
  2. Tell subjects to think of a number which is clearly too low (a lower bound).
  3. Tell subjects to find the midpoint of the upper bound and the lower bound and figure out whether it's too high or too low.
  4. The midpoint has now been judged as an upper/lower bound. Combined with the original lower/upper bound, we have a new, narrower range to explore. If this range is narrow enough, report its midpoint; otherwise go to step 3.

You could have two experimental conditions: one condition where subjects think of a number which is clearly too high first (the steps are in the order above), and another condition where subjects think of a number which is clearly too low first (steps 1 & 2 are swapped). If estimates from the two conditions are similar, the technique is successful.

2 comments

Comments sorted by top scores.

comment by rossry · 2019-08-03T06:41:02.812Z · score: 11 (5 votes) · LW · GW

Hypothesis: (formed before running the test below) "clearly too high" will be more of an overestimate than "clearly too low" is an underestimate; most midpoints will be high; this will bias estimates high (especially through repeated self-anchoring to high midpoints).

Anecdata: I tried using this method to estimate the number of gates in Hong Kong International Airport. (I'm currently standing in a line in HKIA, and have flown through it at least a dozen times in my life.)

  • 40 ~ 10,000
  • 40 ~ 5,020
  • 40 ~ 2,530
  • 40 ~ 1285
  • 40 ~ 662 (maybe 351 is neither obviously too high or too low, so I should take it? or maybe it's slightly high and so...)
  • 40 ~ 351 (195 I don't have a strong opinion about, so I'll take it)

So, depending on how I decide to stop, I get estimates around 195 or 351. Apparently the true answer is 90, supporting my hypothesis.

Proposal: Maybe use geometric mean instead of arithmetic mean?

I tried to clear my head and try again with geomean:

  • 40 ~ 10,000
  • 40 ~ 632 (ehhh, 159 is more likely to high than too low)
  • 40 ~ 159 (80 is too low)
  • 80 ~ 159 (113)

There's one suspect step around 159, but my guess here is that being anchored by one higher number (632) rather than five (5020, 2530, 1285, 662, 351) is enough to actually make me think "probably less than 159" rather than "no strong opinion about 195". Terminating at 159 also is an outperformance of arithmetic mean, but feels a bit more like luck around where the midpoints fell.

comment by Pattern · 2019-08-03T04:50:20.807Z · score: 3 (2 votes) · LW · GW

I wonder if running the algorithm would affect the performance/results of those who haven't been anchored.